algorithmic graph theory - Wolfram|Alpha

Uh oh! Wolfram|Alpha doesn't run without JavaScript.

Please enable JavaScript. If you don't know how, you can find instructionshere.Once you've done that, refresh this page to start using Wolfram|Alpha.

Input interpretation

algorithmic graph theory

Definition

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.

More information »

Related term

graph theory

POWERED BY THE WOLFRAM LANGUAGE