212 search results - page 8 / 43 » Subgraph Isomorphism in Planar Graphs and Related Problems |
109
click to vote
ICDE
2009
IEEE
14 years 7 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...
164
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
131
click to vote
PKDD
2004
Springer
15 years 3 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
101
click to vote
EDBT
2012
ACM
13 years 6 days ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...