6740 search results - page 384 / 1348 » An s -Hamiltonian Line Graph Problem |
123
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
155
click to vote
ALGORITHMICA
2007
15 years 4 months ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
182
click to vote
AI
2011
Springer
14 years 11 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
159
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
151
click to vote
CP
2007
Springer
15 years 11 months ago
2007
Springer
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this...