Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author

DOI10.1007/b138283zbMath1061.05001OpenAlexW3151628504MaRDI QIDQ1889973

Publication date: 14 December 2004

Published in: Algorithms and Computation in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b138283

zbMATH Keywords

network tree complexity algorithm graph path flow coloring matching.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (17)

Algebraic Investigation of Connected Components ⋮ An algorithm to calculate generalized Seifert matrices ⋮ A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem ⋮ New upper bounds for the number of embeddings of minimally rigid graphs ⋮ Decentralized stabilizability of multi-agent systems under fixed and switching topologies ⋮ A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Large Deviation Principle for the Greedy Exploration Algorithm over Erd\"os-R\'enyi Graphs ⋮ Universal Gröbner basis associated with the maximum flow problem ⋮ Circulations, Fuzzy Relations and Semirings ⋮ Formation control of VTOL unmanned aerial vehicles with communication delays ⋮ A survey on global pinning synchronization of complex networks ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ Global stabilization of complex networks with digraph topologies via a local pinning algorithm ⋮ The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields ⋮ The maximum 1-2 matching problem and two kinds of its variants ⋮ Tree-Based Coarsening and Partitioning of Complex Networks

This page was built for publication: Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author