6740 search results - page 333 / 1348 » An s -Hamiltonian Line Graph Problem |
123
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
119
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
104
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
154
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
142
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...