Sciweavers

Share
7 search results - page 1 / 2
» Planar Subgraph Isomorphism Revisited
Sort
View
STACS
2010
Springer
12 years 6 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
CORR
1999
Springer
145views Education» more  CORR 1999»
11 years 11 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
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 ...
David Eppstein
PVLDB
2010
110views more  PVLDB 2010»
11 years 10 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
STACS
2001
Springer
12 years 4 months ago
Evasiveness of Subgraph Containment and Related Properties
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
Amit Chakrabarti, Subhash Khot, Yaoyun Shi
ICALP
2009
Springer
13 years 5 days ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
books