Algorithm 447: Efficient algorithms for graph manipulation

Communications of the ACM

Volumn 16, Issue 6, 1973, Pages 372-378

  Hopcroft, John ^a   Tarjan, Robert ^a  

^a Department of Molecular Biology and Genetics   (United States)

Author keywords

analysis of algorithms; graph manipulation; graphs

Indexed keywords

EID: 84976669902     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362248.362272     Document Type: Article

References (7)

1. Fisher, G.J. Computer recognition and extraction of planar graphs from the incidence matrix. IEEE Trans, in Circuit Theory CT-13, (June 1966), 154-163.
2. Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
3. Holt, R., and Reingold, E. On the time required to detect cycles and connectivity in directed graphs. Comput. Sci. TR 70-33, Cornell U. Ithaca, N.Y.
4. Hopcroft, J., and Tarjan, R. Planarity testing in v log v steps, extended abstract. Stanford U. CS 201, Mar. 1971.
5. Lempel, A., Even, S., and Cederbaum, I. An algorithm for planarity testing of graphs. Theory of Graphs: International Symposium: Rome, July 1966. P. Rosenstiehl (Ed.) Gordon and Breach, New York, 1967, pp. 215-232.
6. Paton, K. An algorithm for the blocks and cutnodes of a graph. Comm. ACM 14, 7 (July 1971), 428-475.
7. Shirey, R.W. Implementation and analysis of efficient graph planarity testing. Ph.D. diss., Comput. Sci. Dep., U. of Wisconsin, Madison, Wis., 1969.