Subgraph isomorphism in planar graphs and related problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 632-640

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; GRAPHIC METHODS; SET THEORY; TREES (MATHEMATICS);

CONSTANT SIZES; INDUCED SUBGRAPH ISOMORPHISMS; LINEAR TIME; PLANAR GRAPH; SHORTEST PATH; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM; TREE-WIDTH;

GRAPH THEORY;

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

References (41)

1. N. Alon, R. Yuster, and U. Zwick. Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In Proc. 26th ACM Symp. Theory of Computing, pages 326-335, 1994.
2. P. J. Artymiuk, P. A. Bath, H. M. Grindley, C. A. Pep-perrell, A. R. Poirrette, D. W. Rice, D. A. Thorner, D. J. Wild, P. Willett, F. H. Allen, and R. Taylor. Similarity searching in databases of three-dimensional molecules and macromolecules. J. Chemical Information and Computer Sciences, 32:617-630, 1992.
3. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Near-linear cost sequential and distributed constructions of sparse neighborhood covers. In Proc. 34th IEEE Symp. Foundations of Computer Science, pages 638647, 1993.
4. B. Awerbuch and D. Peleg. Sparse partitions. In Proc. 31st IEEE Symp. Foundations of Computer Science, pages 503-513, 1990.
5. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. In Proc. 24 th IEEF Symp. Foundations of Computer Science, pages 265-273, 1983.
6. R. Bar-Yehuda and S. Even. On approximating a vertex cover for planar graphs. In Proc. 14th ACM Symp. Theory of Computing, pages 303-309, 1982.
7. D. Bayes and D. Eisenbud. Graph curves. Advances in Mathematics, 86:1-40, 1991.
8. M. W. Bern, E. L. Lawler, and A. L. Wong. Linear-time computation of optimal subgraphs of decomposable graphs. J. Algorithms, 8:216-235, 1987.
9. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small tieewidth. In 25th ACM Symp. Theory of Computing, pages 226-234, 1993.
10. H. L. Bodlaender. On linear time minor tests with depth-first search. J. Algorithms, 14:1-23, 1993.
11. A. D. Brown and P. R. Thomas. Goal-oriented subgraph isomorphism technique for IC device recognition. IEE Proceedings I (Solid-State and Electron Devices), 135:141-150, 1988.
12. N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Computing, 14:210-223, 1985.
13. M. Chrobak and D. Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theoretical Computer Science, 86:243-266, 1991.
14. M. B. Dillencourt and W. D. Smith. A linear-time algorithm for testing the inscribability of trivalent polyhedra. In Proc. 8th ACM Symp. Computational Geometry, pages 177-185, 1992.
15. D. Eppstein. Connectivity, graph minors, and subgraph multiplicity. J. Graph Theory, 17:409-416, 1993.
16. D. Eppstein. Arboricity and bipartite subgraph listing algorithms. Inform. Proc. Lett., 51:207-211, 1994.
17. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM I. Computing, 16:1004-1022, 1987.
18. G. N. Frederickson and R. Janardan. Efficient message routing in planar networks. SIAM J. Computing, 18:843-857, 1989.
19. G. N. Frederickson and R. Janardan. Space-efficient message routing in c-decomposable networks. SIAM J. Computing, 19:14-30, 1990.
20. A. Guha. Optimizing codes for concurrent fault detection in microprogrammed controllers. In Proc. IEEE Intl. Conf. Computer Design: VLSI in Computers and Processors (ICCD '87), pages 486-489, 1987.
21. Hong Dong, Youshou Wu, and Xiaoqiag Ding. An ARG representation for Chinese characters and a radical extraction based on the representation. In 9th IEEE Intl. Conf. Pattern Recognition, volume 2, pages 920922, 1988.
22. A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM J. Computing, 7:413-423, 1978.
23. J. M. Keil and T. B. Brecht. The complexity of clustering in planar graphs. J. Combinatorial Mathematics and Combinatorial Computing, 9:155-159, 1991.
24. P. N. Klein and S. Sairam. Fully dynamic approximation schemes for shortest path problems in planar graphs. In Proc. 3rd Worksh. Algorithms and Data Structures, pages 442-451. Lecture Notes in Computer Science 709, Springer-Verlag, Berlin, 1993.
25. G. Kortsarz and D. Peleg. On choosing a dense subgraph. In 34th IEEE Symp. Foundations of Computer Science, pages 692-703, 1993.
26. S. Y. T. Lang and A. K. C. Wong. A sensor model registration technique for mobile robot localization. In Proc. 1991 IEEE Intl. Symp. Intelligent Control, pages 298-305, 1991.
27. J.-P. Laumond. Connectivity of plane triangulations. Information Processing Letters, 34:87-96, 1990.
28. R. Levinson. Pattern associativity and the retrieval of semantic networks. Computers & Mathematics with Applications, 23:573-600, 1992.
29. A. Lingas. Subgraph isomorphism for biconnected out-erplanar graphs in cubic time. Theoretical Computer Science, 63:295-302, 1989.
30. A. Lingas and A. Proskurowski. On parallel complexity of the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs. Theoretical Computer Science, 68:155-173, 1989.
31. A. Lingas and M. M. Syslo. A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs. In Proc. 15th Int. Colloq. Automata, Languages and Programming, pages 394-409. Lecture Notes in Computer Science 317, Springer-Verlag, 1988.
32. C. H. Papadimitriou and M. Yannakakis. The clique problem for planar graphs. Information Processing Letters, 13:131-133, 1981.
33. J. Plehn and B. Voigt. Finding minimally weighted subgraphs. In Proc. 16th Intl. Worksh. WG90, Graph-Theoretic Concepts in Computer Science, pages 1829. Lecture Notes in Computer Science 484, Springer-Verlag, 1991.
34. D. Richards. Finding short cycles in planar graphs using separators. J. Algorithms, 7:382-394, 1986.
35. N. Robertson and P. D. Seymour. Graph minors V: excluding a planar graph. J. Combinatorial Theory B, 41:92-114, 1986.
36. N. Robertson, P. D. Seymour, and R. Thomas. A survey of linkless embeddings. In Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors, pages 125136. Contemporary Mathematics 147, Amer. Math. Soc, 1991.
37. T. Stahs and F. Wahl. Recognition of polyhedral objects under perspective views. Computers and Artificial Intelligence, 11:155-172, 1992.
38. M. M. Syslo. The subgraph isomorphism problem for outerplanar graphs. Theoretical Computer Science, 17:91-97, 1982.
39. K. Takamizawa, T. Nishizeki, and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Computing Machinery, 29:623-641, 1982.
40. Thang Nguyen Bui and A. Peck. Partitioning planar graphs. SIAM J. Computing, 21:203-215, 1992.
41. D. J. A. Welsh. Knots and braids: some algorithmic questions. In Graph Structure Theory: Proc. Joint Summer Conf. Graph Minors, pages 109-124. Contemporary Mathematics 147, Amer. Math. Soc, 1991.