Sequential and parallel algorithms to find a K5 minor

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 345-356

  Kézdy, André ^a,b   McGuinnesst, Patrick ^c  

^a UNIVERSITY OF LOUISVILLE   (United States)

^b MOTOROLA INC   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84870409242     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. T. Asano. An approach to the Subgraph Home-omorphism problem. Theoretical Computer Science, 38:249-267, 1985.
2. R. Cole. Parallel merge sort. SIAM J. Computing, 17:770-785, 1988.
3. R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree and graph problems. Proc. of 27th IEEE Symposium of Foundations of Computer Science, pages 478-491, 1986.
4. G. A. Dirac. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Untereilungen. Math. Nachr., 22:61-85, 1960.
5. M. R. Fellows and P. Kaschube. Searching for K3, 3 in linear time. Journal of Linear and Multilinear Algebra. To appear.
6. D. Fussell, V. Ramachandran, and R. Thurimella. Finding triconnected components by local replacements. Proc. of 16th ICALP, LNCS 372, pages 379393, 1989.
7. E. Györi. On the edge number of graphs with Hadwiger number 4 and 5. Periodica Mathematica Hungarica, 13:21-27, 1982.
8. R. Haiin. Zur Klassification der endlichen Graphen nach H. Hadwiger und K. Wagner. Math. Annalen, 172:46-78, 1967.
9. J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Computing, 4:507-518, 1973.
10. J. E. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21:549-568, 1974.
11. P. A. Kaschube. Finding a subgraph homeomorphic to 3, 3 in polynomial time. PhD thesis, University of California, San Diego, 1984.
12. S. Khulier, S. G. Mitchell, and V. V. Vazirani. Processor efficient parallel algorithms for the Two Disjoint Paths problem, and for finding a Kura-towski homeomorph. Proc. of 30th IEEE Symposium on Foundations of Computer Science, pages 300-305, 1989.
13. A. Kanevsky and V. Ramachandran. Improved algorithms for graph four-connectivity. Proc. of 28th IEEE Symposium on Foundations of Computer Science, pages 252-259, 1987.
14. P. C. Lui and R. C. Geldmacher. An 0(max(m, n)) algorithm for finding a subgraph homeomorphic to K. Congressius Numeratium, 29:597-609, 1980.
15. G. L. Miller and V. Ramachandran. A new graph triconnectivity algorithm and its parallelization. Combinatorica, 7:105-114, 1988.
16. N. Robertson and P. D. Seymour. Graph minors XIII. The Disjoint Paths problem, 1986. manuscript.
17. P. D. Seymour. On Tutte's extension of the Four-Colour problem. Journal of Combinatorial Theory, Series B, 31:82-94, 1981.
18. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1:146-160, 1972.
19. K. Wagner. Uber eine Eigenshaft der ebenen Komplexe. Math. Annalen, 114:570-590, 1937.
20. K. Wagner. Bemerkungen zu Hadwigers Vermutung. Math. Annalen, 141:433-451, 1960.
21. S. G. Williamson. Depth-first search and Kura-towski subgraphs. J. ACM, 31:681-693, 1984.
22. H. P. Young. A quick proof of Wagner's equivalence theorem. J. London Math. Soc. (2), 3:661-664, 1971.