Sequential and parallel algorithms to find a K 5 minor

[1]  H. Young.  A Quick Proof of Wagner's Equivalence Theorem , 1971 .

[2]  Paul Seymour,et al.  On Tutte's extension of the four-colour problem , 1981, J. Comb. Theory, Ser. B.

[3]  K. Wagner.  Bemerkungen zu Hadwigers Vermutung , 1960 .

[4]  Takao Asano,et al.  An Approach to the Subgraph Homeomorphism Problem , 1985, Theor. Comput. Sci..

[5]  Gary L. Miller,et al.  A new graphy triconnectivity algorithm and its parallelization , 1987, STOC.

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

[7]  Arkady Kanevsky,et al.  Improved Algorithms for Graph Four-Connectivity , 1987, FOCS.

[8]  Donald S. Fussell,et al.  Finding Triconnected Components by Local Replacements , 1989, ICALP.

[9]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[10]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[11]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[12]  Samir Khuller,et al.  Processor efficient parallel algorithms for the two disjoint paths problem, and for finding a Kuratowski homeomorph , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[14]  S. Gill Williamson,et al.  Depth-First Search and Kuratowski Subgraphs , 1984, JACM.