13 search results - page 3 / 3 » A [k, k 1]-Factor Containing A Given Hamiltonian Cycle |
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
SOFSEM
2010
Springer
14 years 18 days ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
SPAA
2004
ACM
13 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...