Sciweavers

251 search results - page 11 / 51
» The Graphs with All Subgraphs T-Perfect
Sort
View
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 2 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
JCT
2011
90views more  JCT 2011»
13 years 2 months ago
Small subgraphs in random graphs and the power of multiple choices
The standard paradigm for online power of two choices problems in random graphs is the Achlioptas process. Here we consider the following natural generalization: Starting with G0 a...
Torsten Mütze, Reto Spöhel, Henning Thom...
DM
2007
57views more  DM 2007»
13 years 7 months ago
Triangulated neighborhoods in even-hole-free graphs
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
Murilo Vicente Gonçalves da Silva, Kristina...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
JUCS
2007
120views more  JUCS 2007»
13 years 7 months ago
Hamiltonicity of Topological Grid Graphs
: In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of th...
Christina Zamfirescu, Tudor Zamfirescu