David Eppstein  Home/Search
Context Related
| emis.de/journals/J...pstein99.3.3.ps.gz brown.edu/publicat...pstein99.3.3.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: emis.de/journals/JGAA/home (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic programming within each piece. The same methods can be used to solve other planar graph problems including connectivity, diameter, girth, induced subgraph isomorphism, and shortest paths. (Update)
Cited by: More
Effective Rule Induction from Molecular Structures.. - Hoche, Horvath, Wrobel (Correct)
Subgraph Isomorphism, log-Bounded Fragmentation, and.. - Hajiaghayi, Nishimura (Correct)
Approximation Algorithms for Classes of Graphs.. - Demaine.. (Correct)
Similar documents (at the sentence level):
12.3%: Subgraph Isomorphism in Planar Graphs and Related Problems - Eppstein (1995) (Correct)
Active bibliography (related documents): More All
1.6: Arboricity and Bipartite Subgraph Listing Algorithms - Eppstein (1994) (Correct)
0.4: Algorithms for Graphs of (Locally) Bounded Treewidth - Hajiaghayi (2001) (Correct)
0.4: Connectivity of Planar Graphs - de Fraysseix, de Mendez (2001) (Correct)
Similar documents based on text: More All
0.5: Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of.. - Hajiaghayi (Correct)
0.5: Subgraph Isomorphism in Polynomial Time - Messmer, Bunke (1995) (Correct)
0.4: Separator-Based Sparsification II: Edge And Vertex.. - Eppstein, Galil.. (1998) (Correct)
Related documents from co-citation: More All
16: Approximation algorithms for NP-complete problems on planar graphs (context) - Baker - 1983
14: Diameter and treewidth in minor-closed graph families (context) - Eppstein
11: Applications of a planar separator theorem (context) - Lipton, Tarjan - 1980
BibTeX entry: (Update)
D. Eppstein. Subgraph isomorphism in planar graphs and related problems. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pages 632--640, 1995. http://citeseer.ist.psu.edu/eppstein99subgraph.html More
@inproceedings{ eppstein95subgraph,
author = "Eppstein",
title = "Subgraph Isomorphism in Planar Graphs and Related Problems",
booktitle = "{SODA}: {ACM}-{SIAM} Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms)",
year = "1995",
url = "citeseer.ist.psu.edu/eppstein99subgraph.html" }
Citations (may not include all citations):149 Approximation algorithms for NP-complete problems on planar .. (context) - Baker - 1994
54 Ambivalent data structures for dynamic 2-edgeconnectivity an.. - Frederickson - 1997
45 Linear-time computation of optimal subgraphs of decomposable.. (context) - Bern, Lawler et al. - 1987
41 Arboricity and subgraph listing algorithms (context) - Chiba, Nishizeki - 1985
41 Diameter and treewidth in minor-closed graph families (context) - Eppstein
37 Pattern associativity and the retrieval of semantic networks - Levinson - 1992
33 Fast algorithms for shortest paths in planar graphs (context) - Frederickson - 1987
31 Subgraph isomorphism in planar graphs and related problems - Eppstein - 1995
28 Linear-time computability of combinatorial problems on serie.. (context) - Takamizawa, Nishizeki et al. - 1982
22 Planar orientations with low out-degree and compaction of ad.. - Chrobak, Eppstein - 1991
20 line maintenance of the four-connected components of a graph (context) - Kanevsky, Tamassia et al. - 1991
20 Finding a minimum circuit in a graph (context) - Itai, Rodeh - 1978
19 Near-linear time construction of sparse neighborhood covers (context) - Awerbuch, Berger et al. - 1998
18 Color-coding - Alon, Yuster et al. - 1995
17 Ecient message routing in planar networks (context) - Frederickson, Janardan - 1989
15 the succinct representation of graphs (context) - Tur, On - 1984
14 Foundations of Computer Science (context) - Kortsarz, Peleg et al. - 1993
14 Foundations of Computer Science (context) - Awerbuch, Peleg et al. - 1990
12 A linear-time algorithm for testing the inscribability of tr.. - Dillencourt, Smith - 1992
9 Subgraph isomorphism for biconnected outerplanar graphs in c.. (context) - Lingas - 1989
9 Arboricity and bipartite subgraph listing algorithms - Eppstein - 1994
9 Information Processing Letters (context) - Papadimitriou, Yannakakis et al. - 1981
8 Finding short cycles in planar graphs using separators (context) - Richards - 1986
8 Partitioning planar graphs (context) - Bui, Peck - 1992
7 A matroid approach to nding edge connectivity and packing ar.. (context) - Gabow - 1995
7 Similarity searching in databases of three-dimensional molec.. (context) - Artymiuk, Bath et al. - 1992
7 Fully dynamic approximation schemes for shortest path proble.. - Klein, Sairam - 1998
7 A polynomial-time algorithm for subgraph isomorphism of two-.. (context) - Lingas, lo - 1988
7 Space-ecient message routing in c-decomposable networks (context) - Frederickson, Janardan - 1990
6 Low-diameter graph decomposition is in NC - Awerbuch, Berger et al. - 1992
6 Goal-oriented subgraph isomorphism technique for IC device r.. (context) - Brown, Thomas - 1988
6 The subgraph isomorphism problem for outerplanar graphs (context) - lo - 1982
6 decision and the eciency of polynomial-time algorithms (context) - Fellows, Langston - 1989
5 and subgraph multiplicity (context) - Eppstein, graph - 1993
5 Recognition of polyhedral objects under perspective views (context) - Stahs, Wahl - 1992
4 A sensor model registration technique for mobile robot local.. (context) - Lang, Wong - 1991
4 An ARG representation for Chinese characters and a radical e.. (context) - Hong, Wu et al. - 1988
4 Optimizing codes for concurrent fault detection in microprog.. (context) - Guha - 1987
4 Connectivity of plane triangulations (context) - Laumond - 1990
3 Separator based sparsi cation II: edge and vertex connectivi.. (context) - Eppstein, Galil et al. - 1999
3 Genetic programming as a Darwinian invention machine (context) - Koza, Bennett et al. - 1999
3 Combinatorial Mathematics and Combinatorial Computing (context) - Keil, Brecht et al. - 1991
3 Advances in Math (context) - Bayer, Eisenbud - 1991
2 Graph-Theoretic Concepts in Computer Science (context) - Plehn, Voigt et al. - 1991
2 Joint Summer Res (context) - Robertson, Seymour et al. - 1991
2 On parallel complexity of the subgraph homeomorphism and the.. (context) - Lingas, Proskurowski - 1989
1 On approximating a vertex cover for planar graphs (context) - Bar-Yehuda, Even - 1982
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC