Algorithm 447: efficient algorithms for graph manipulation
暂无分享,去创建一个
[1] Keith Paton,et al. An algorithm for the blocks and cutnodes of a graph , 1971, Commun. ACM.
[2] Robert E. Tarjan,et al. Planarity Testing in V log V Steps: Extended Abstract , 1971, IFIP Congress.
[3] Richard C. Holt,et al. On the Time Required to Detect Cycles and Connectivity in Directed Graphs , 1970 .
[4] Robert William Shirey,et al. Implementation and analysis of efficient graph planarity testing algorithms , 1969 .
[5] Frank Harary,et al. Graph Theory , 2016 .
[6] O. Wing,et al. Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix , 1966 .
[7] Keith Paton,et al. An algorithm for the blocks and cutnodes of a graph , 1971, Commun. ACM.
[8] Robert E. Tarjan,et al. Planarity Testing in V log V Steps: Extended Abstract , 1971, IFIP Congress.
[9] Richard C. Holt,et al. On the Time Required to Detect Cycles and Connectivity in Directed Graphs , 1970 .
[10] Robert William Shirey,et al. Implementation and analysis of efficient graph planarity testing algorithms , 1969 .
[11] O. Wing,et al. Computer Recognition and Extraction of Planar Graphs from the Incidence Matrix , 1966 .