Digraphs

511.1

Bang-Jensen, Jørgen. Digraphs Theory, Algorithms and Applications / by Jørgen Bang-Jensen, Gregory Z. Gutin. -
XXII, 798 p. 175 illus. online resource. - (Springer Monographs in Mathematics, ) Content notes : 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. 9781848009981 * Combinatorics. Mathematical optimization. Algorithms. Computer software. Discrete Mathematics. Combinatorics. Optimization. Calculus of Variations and Optimal Control; Optimization. Algorithms. Algorithm Analysis and Problem Complexity. * Gutin, Gregory Z., aut, http://id.loc.gov/vocabulary/relators/aut * Title * Series