6740 search results - page 402 / 1348 » An s -Hamiltonian Line Graph Problem |
161
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
146
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
162
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
163
Voted
DAM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
217
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...