Efficient Algorithms for Graph Manipulation [H] (Algorithm A447)

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 is iterative 
and each iteration produces a new path between two
vertices already on paths.  (The start vertex can 
be specified dynamically.)  If V is the number of vertices
and E is the number of edges, each algorithm 
requires time and space proportional to max (V,E)
when executed on a random access computer.

CACM June, 1973

Hopcroft, J.
Tarjan, R.

graphs,analysis of algorithms, graph manipulation

5.32

CA730610 JB January 23, 1978  1:55 PM

2490	4	2490
2177	5	2490
2490	5	2490
2490	5	2490
2490	5	2490