459 search results - page 18 / 92 » Detecting induced subgraphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
TCS
2010
13 years 6 months ago
2010
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
DAM
2008
13 years 8 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
WG
2010
Springer
13 years 6 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...