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 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.
[1] Frank Harary,et al. Graph Theory , 2016 .
[2] Richard C. Holt,et al. On the Time Required to Detect Cycles and Connectivity in Directed Graphs , 1970 .
[3] Robert E. Tarjan,et al. Planarity Testing in V log V Steps: Extended Abstract , 1971, IFIP Congress.