Algorithm 447: efficient algorithms for graph manipulation
Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths. The algorithm for partitioning of a graph…
Algorithm 447: efficient algorithms for graph manipulation
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved