Algorithm 447: efficient algorithms for graph manipulation
Published in Communications of the ACM • Jun 1, 1973
Authors:,
John Hopcroft
Robert Tarjan
Abstract
Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths. The algorithm for partitioning of a graph into simple paths of iterative and each iteration produces a new path between two vertices already on paths. (The start vertex can...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!