803 search results - page 44 / 161 » Independence in Direct-Product Graphs |
112
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
136
Voted
GC
2008
Springer
15 years 21 days ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
JCT
2007
15 years 16 days ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
191
click to vote
ICDE
2007
IEEE
16 years 2 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...
104
click to vote
CORR
2004
Springer
15 years 15 days ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...