1933 search results - page 44 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
121
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
131
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
152
click to vote
TCS
2008
15 years 3 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
129
Voted
ESA
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
138
click to vote
FUN
2007
Springer
15 years 7 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...