Digraphs Theory, Algorithms and Applications /
The theory of directed graphs has developed enormously over recent decades, yet this book (first published in 2000) remains the only book to cover more than a small fraction of the results. New research in the field has made a second edition a necessity. Substantially revised, reorganised and update...
Κύριοι συγγραφείς: | , |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
London :
Springer London,
2009.
|
Σειρά: | Springer Monographs in Mathematics,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Basic Terminology, Notation and Results
- Classes of Digraphs
- Distances
- Flows in Networks
- Connectivity of Digraphs
- Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles
- Restricted Hamiltonian Paths and Cycles
- Paths and Cycles of Prescribed Lengths
- Branchings
- Linkages in Digraphs
- Orientations of Graphs and Digraphs
- Sparse Subdigraphs with Prescribed Connectivity
- Packings, Coverings and Decompositions
- Increasing Connectivity
- Feedback Sets and Vertex Orderings
- Generalizations of Digraphs: Edge-Coloured Multigraphs
- Applications of Digraphs and Edge-Coloured Graphs
- Algorithms and Their Complexity.