3008 search results - page 22 / 602 » Independence in connected graphs |
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...
79
Voted
ENTCS
2008
15 years 22 days ago
2008
The current paper presents a novel approach to implement a graph transformation engine as an EJB3-specific plugin by using EJB QL queries for pattern matching. The essence of the ...
116
Voted
JCT
2007
15 years 16 days ago
2007
Let G be a simple graph with n vertices and m edges. Let ω(G) and α(G) be the numbers of vertices of the largest clique and the largest independent set in G, respectively. In th...
95
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present algorithmic lower bounds on the size of the largest independent sets of vertices in a random d-regular graph. Our bounds hold with probability approaching one ...
JGT
2010
14 years 11 months ago
2010
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether...