Showing papers on "Graph partition published in 1971"
01 Mar 1971
TL;DR: Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths.
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 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.
346 citations
TL;DR: In this paper, the authors describe a partition of the points of a graph which is related to its automorphism group, and prove that the group of a tree is trivial if and only if this partition is the trivial one.
Abstract: We describe a partition of the points of a graph which is related to its automorphism group. We then prove that the group of a tree is trivial if and only if this partition is the trivial one, and we formulate an algorithm which produces such a partition. Some application to graphs in general are also considered.
2 citations