715 search results - page 6 / 143 » On graphs with subgraphs having large independence numbers |
DM
2006
13 years 7 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
GBRPR
2003
Springer
14 years 20 days ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
GD
1999
Springer
13 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
DM
1998
13 years 7 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...