Graphs And Algorithms
Michel Gondran, Michel Minoux
Abstract
Michel Gondran, Michel Minoux
Abstract
Presents a review of graph theory, analyzing the existing links between abstract theoretical results and their practical implications using graph theoretical models and combinatorial algorithms. Includes extensive examples to illustrate the mathematical concepts when introduced. Treats subjects often excluded in other texts such as path algebra flow with grains, multicommodity flows, and the analysis and design of approximate algorithms.
OpenAlex reports 624 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Presents a review of graph theory, analyzing the existing links between abstract theoretical results and their practical implications using graph theoretical models and combinatorial algorithms. Includes extensive examples to illustrate the mathematical concepts when introduced. Treats subjects often excluded in other texts such as path algebra flow with grains, multicommodity flows, and the analysis and design of approximate algorithms.
Key concepts: Computer science, Graph theory, Algorithm, Graph, Path (computing), Graph algorithms, Theoretical computer science, Mathematics