Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and Hamiltonian cycles, spanning trees, network flow problems, and graph coloring (Gibbons 1971).
Algorithmic Graph Theory
See alsoGraph Theory
This entry contributed by Stuart Wilson
Explore with Wolfram|Alpha
ReferencesChartrand, G. Applied and Algorithmic Graph Theory. New York: McGraw-Hill, p. 116, 1992.Gibbons, A. Algorithmic Graph Theory. New York: Cambridge University Press, 1971.Golumbic, M. C. Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 1980.Turau, V. Algorithmische Graphentheorie, 2nd ed. Oldenbourg, 2004.
Referenced on Wolfram|AlphaAlgorithmic Graph Theory
Cite this as:
Wilson, Stuart. "Algorithmic Graph Theory." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/AlgorithmicGraphTheory.html