Digraphs : theory, algorithms, and applications / Jorgen Bang-Jensen and Gregory Gutin

Auteur principal : Bang-Jensen, Jørgen, 1960-, AuteurCo-auteur : Gutin, Gregory, 1957-, AuteurType de document : Livre numériqueCollection : Springer monographs in mathematicsLangue : anglais.Éditeur : London : Springer, 2009ISBN: 9781848009981.ISSN: 1439-7382.Sujet MSC : 05-02, Research exposition (monographs, survey articles) pertaining to combinatorics
05C20, Combinatorics - Graph theory, Directed graphs (digraphs), tournaments
05C40, Combinatorics - Graph theory, Connectivity
05C45, Combinatorics - Graph theory, Eulerian and Hamiltonian graphs
05C85, Combinatorics - Graph theory, Graph algorithmsEn-ligne : Springerlink | Zentralblatt
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Contents: 1. Basic terminology, notation and results; 2. Classes of digraphs; 3. Distances; 4. Flows in networks; 5. Connectivity of digraphs; 6. Hamiltonian, longest and vertex-cheapest paths and cycles; 7. Restricted Hamiltonian paths and cycles; 8. Paths and cycles of prescribed lengths; 9. Branchings; 10. Linkages in digraphs; 11. Orientations of graphs and digraphs; 12. Sparse subdigraphs with prescribed connectivity; 13. Packings, coverings and decompositions; 14. Increasing connectivity; 15. Feedback sets and vertex orderings; 16. Generalizations of digraphs: edge-coloured multigraphs; 17. Applications of digraphs and edge-coloured graphs; 18. Algorithms and their complexity.

There are no comments on this title.

to post a comment.