论文信息 - Finding triconnected components of graphs - 字舞流文

Finding triconnected components of graphs

(1983). Finding triconnected components of graphs. Linear and Multilinear Algebra: Vol. 13, No. 2, pp. 143-165.

[1] S. Lane. A structural characterization of planar combinatorial graphs , 1937 .

[2] W. T. Tutte. Connectivity in graphs , 1966 .

[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[4] Robert E. Tarjan,et al. Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.

[5] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Shimon Even,et al. An Algorithm for Determining Whether the Connectivity of a Graph is at Least k , 1973, SIAM J. Comput..

[8] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..

[9] S. G. Williamson,et al. Embedding Graphs in the Plane—Algorithmic Aspects , 1980 .

[10] K. Vo,et al. Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs , 1983 .