803 search results - page 7 / 161 » Independence in Direct-Product Graphs |
104
click to vote
AAAI
2006
15 years 2 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
87
Voted
ORL
2007
15 years 7 days ago
2007
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
80
Voted
JCT
2006
15 years 21 days ago
2006
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...
118
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
For a given connected graph G on n vertices and m edges, we prove that its independence number α(G) is at least ((2m+n+2) -((2m+n+2)2 -16n2 )½ )/8. Keywords : independence numbe...
127
click to vote
COLOGNETWENTE
2010
14 years 11 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...