6740 search results - page 307 / 1348 » An s -Hamiltonian Line Graph Problem |
122
Voted
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...
181
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
140
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
151
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
151
click to vote
FSTTCS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...