scientific article; zbMATH DE number 3988689
Writing this book the authors have the following aims: 1) the design and complexity analysis of algorithms of fundamental graph- theoretical problems; 2) the effective implementation of corresponding programs from the point of view of homogeneity, modularity, portability, readability, structurability and efficiency; 3) the methodological tool for the demonstration of basic programming techniques on examples. Recently the algorithms of graph theory have become the standard topic of lectures on programming. Also they can be found in the majority of textbooks on programming. The monograph under review consists of nine chapters. Reading through this book the reader gets acquainted with most of the basic algorithmical problems in graph theory, i.e., connectivity, shortest paths, graph without circuits, spanning trees, arborescenses, max flows/min cuts, matchings, eulerian tours. The book is a self- contained exposition on methodology how to design, analyze and implement particular algorithms; moreover a minimum of mathematical background is needed. A great attention is paid to the computational complexity and efficiency of the implementation on suitable data structures. Every description of each algorithm follows this structure: introduction and mathematical formulation of the problem, mathematical complexity analysis, choice of data structures, description of the algorithms in words, implementation in FORTRAN including the listing with the source program. As an overall judgement this book could be useful for students of computer science as well as workers in various applied areas of graph theory. On the other hand for methodological and didactic reasons one could expect the encoding of algorithms in PASCAL-type languages.
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Local algorithms on graphs
- Implicit graphs
- scientific article; zbMATH DE number 3872626 (Why is no real title available?)
- scientific article; zbMATH DE number 49984 (Why is no real title available?)
- Basic graph algorithms
- scientific article; zbMATH DE number 194946 (Why is no real title available?)
- scientific article; zbMATH DE number 4121464 (Why is no real title available?)
- A Java Library of Graph Algorithms and Optimization
- Structurally fixed modes: Decomposition and reachability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750987)