112
click to vote
WG
15 years 6 months ago
2007 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 ...
WG
15 years 6 months ago
2007 Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
WG
15 years 6 months ago
2007 Springer 
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
WG
15 years 6 months ago
2007 Springer 
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
69
Voted
WG
15 years 6 months ago
2007 Springer  |
Theoretical Computer Science