graph theory (redirected from Algorithmic graph theory)

graph theory

Mathematical theory of networks. A graph consists of vertices (also called points or nodes) and edges (lines) connecting certain pairs of vertices. An edge that connects a node to itself is called a loop. In 1735 Leonhard Euler published an analysis of an old puzzle concerning the possibility of crossing every one of seven bridges (no bridge twice) that span a forked river flowing past an island. Euler's proof that no such path exists and his generalization of the problem to all possible networks are now recognized as the origin of both graph theory and topology. Since the mid-20th century, graph theory has become a standard tool for analyzing and designing communications networks, power transmission systems, transportation networks, and computer architectures.

---

graph theory [′graf ‚thē·ə·rē]

(mathematics)

The mathematical study of the structure of graphs and networks.

The body of techniques used in graphing functions in the plane.