Suurballe's algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search


English Wikipedia has an article on:


Devised by John W. Suurballe and published in 1974.

Proper noun[edit]

Suurballe's algorithm

  1. (computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length.