5889 search results - page 355 / 1178 » Graph Layout Problems |
198
click to vote
LSSC
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Multiple sequence alignment is a key process in today’s biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing so...
148
click to vote
WG
2005
Springer
16 years 7 days ago
2005
Springer
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most edge insertions or deletions such that it becomes a 4-leaf powe...
163
click to vote
GECCO
2004
Springer
16 years 5 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 ...
151
Voted
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...
161
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...