Graphs, networks and algorithms
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
The first English edition of this book, in 1998 (see Zbl 0931.05001), was based on a translation of the third edition of the author's German text [Graphen, Netzwerke und Algorithmen (1987; Zbl 0644.05001)]. The second edition in 2005 (see Zbl 1061.05001) added material on the network simplex method and the five-colour theorem. The third edition of this standard textbook contains further new material on graphical codes and their decoding, and many additional exercises. Recent developments for the travelling salesman problem are presented as well. At the same time, the presentation has been updated and minor corrections have been carried out. The chapters cover basic graph theory, algorithms and complexity, shortest paths, spanning trees, the greedy algorithm, flows, combinatorial applications, connectivity and depth first search, colorings, circulations, the network simplex method, the synthesis of networks, matchings, and the travelling salesman problem. The three appendices include a list of some related NP-complete problems, solutions for most of the chapter exercises, and a list of symbols used in the text. The book provides a comprehensive list of references. Appendix B, containing sample solutions for exercises, is of particular value. The solutions are concise and elegant, and integrate well with the presentation. The writing is clear and precise. The underlying mathematics is treated carefully, and developed well. The focus on algorithmic issues motivates challenging questions, and connects the presentation to many real applications. These make the text appropriate for computer science and engineering students, in addition to students of mathematics. The diversity of applications represented is a real strength of the text. While the author has more than adequately treated the conventional applications of graph-theoretic algorithms in networks, the topics treated are much broader. This in turn provides connections to other areas of mathematics, and applications, that serve to motivate students. The book is highly recommended.
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- scientific article; zbMATH DE number 3503127
- scientific article; zbMATH DE number 2202358
- Graphs, Algorithms, and Optimization
- scientific article; zbMATH DE number 53892
- scientific article; zbMATH DE number 53191
- scientific article; zbMATH DE number 1227011
- scientific article; zbMATH DE number 3906496
- Graphs and algorithms
- scientific article; zbMATH DE number 777378
- Parameterized complexity of candidate control in elections and related digraph problems
- Graphs, networks and algorithms. Transl. from the 3rd German edition by Tilla Schade
- Efficiency of the pMST and RDELA location and scatter estimators
- On finite-sample robustness of directional location estimators
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- A relation of dominance for the bicriterion bus routing problem
- A bag-of-paths framework for network data analysis
- Dynamic dispatching and repositioning policies for fast-response service networks
- Some remarks on segregation of \(k\) species in strongly competing systems
- Constructing Armstrong tables for general cardinality constraints and not-null constraints
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Intrinsic formulation and Lagrange duality for elastic cable networks with geometrical nonlinearity
- Graph-theoretic concepts and algorithms
- Passivity based attitude control of rigid bodies
- Counting critical formations on the circle: algebraic-geometric and Morse-theoretic bounds
- scientific article; zbMATH DE number 3887060 (Why is no real title available?)
- GRAPHS, NETWORKS AND ACE
- Graphs and algorithms
- Graph theory: modeling, applications, and algorithms
- scientific article; zbMATH DE number 4049649 (Why is no real title available?)
- Towards an optimization theory for deforming dense granular materials: minimum cost maximum flow solutions
- Robust estimation of location and scatter by pruning the minimum spanning tree
- scientific article; zbMATH DE number 53892 (Why is no real title available?)
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- Graphs, networks and algorithms.
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- Orbital diameters of the symmetric and alternating groups
- Inverse shortest path models based on fundamental cycle bases
- Parallel algorithms for the maximum flow problem with minimum lot sizes
- Mutually avoiding Eulerian circuits
- Long paths in hypercubes with a quadratic number of faults
This page was built for publication: Graphs, networks and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883709)
