6740 search results - page 404 / 1348 » An s -Hamiltonian Line Graph Problem |
162
click to vote
GECCO
2004
Springer
16 years 4 days ago
2004
Springer
In this paper we describe an ant system algorithm (ASMC) for the problem of finding the maximum clique in a given graph. In the algorithm each ant has only local knowledge of the ...
149
click to vote
IJCAI
2003
15 years 8 months ago
2003
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...
158
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study problems of reconguration of shortest paths in graphs. We prove that the shortest reconguration sequence can be exponential in the size of the graph and that it is NP-hard...
171
click to vote
JGT
2010
15 years 5 months ago
2010
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
159
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...