↓ Skip to main content
What is this page? Embed badge

Digraphs : theory, algorithms and applications

Overview of attention for book
Cover of 'Digraphs : theory, algorithms and applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Basic Terminology, Notation and Results
  3. Altmetric Badge
    Chapter 2 Classes of Digraphs
  4. Altmetric Badge
    Chapter 3 Distances
  5. Altmetric Badge
    Chapter 4 Flows in Networks
  6. Altmetric Badge
    Chapter 5 Connectivity of Digraphs
  7. Altmetric Badge
    Chapter 6 Hamiltonian, Longest and Vertex-Cheapest Paths and Cycles
  8. Altmetric Badge
    Chapter 7 Restricted Hamiltonian Paths and Cycles
  9. Altmetric Badge
    Chapter 8 Paths and Cycles of Prescribed Lengths
  10. Altmetric Badge
    Chapter 9 Branchings
  11. Altmetric Badge
    Chapter 10 Linkages in Digraphs
  12. Altmetric Badge
    Chapter 11 Orientations of Graphs and Digraphs
  13. Altmetric Badge
    Chapter 12 Sparse Subdigraphs with Prescribed Connectivity
  14. Altmetric Badge
    Chapter 13 Packings, Coverings and Decompositions
  15. Altmetric Badge
    Chapter 14 Increasing Connectivity
  16. Altmetric Badge
    Chapter 15 Feedback Sets and Vertex Orderings
  17. Altmetric Badge
    Chapter 16 Generalizations of Digraphs: Edge-Coloured Multigraphs
  18. Altmetric Badge
    Chapter 17 Applications of Digraphs and Edge-Coloured Graphs
  19. Altmetric Badge
    Chapter 18 Algorithms and Their Complexity
Attention for Chapter 3: Distances
Altmetric Badge

Citations

dimensions_citation
733 Dimensions

Readers on

mendeley
1 Mendeley
Summary Dimensions citations
So far, Dimensions has found 733 publications that cite this research output.

733

The most recent citing publications are shown below. View all 733 publications that cite this research output on Dimensions.

This page shows the most recent citations of this research output.

Click here to find out how to access more activity.

This page is provided by Altmetric.