71 search results - page 12 / 15 » A fixed-parameter algorithm for the directed feedback vertex... |
WG
2007
Springer
14 years 1 months ago
2007
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 ...
BIBM
2008
IEEE
14 years 1 months ago
2008
IEEE
Network alignments are extensively used for comparing, exploring, and predicting biological networks. Existing alignment tools are mostly based on isomorphic and homeomorphic embe...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
ICIAP
1997
ACM
13 years 11 months ago
1997
ACM
A strategy in solving the shape from shading problem for the shape and albedo recovery of book surfaces under the fully perspective environment is proposed. The whole recovery proc...
FOCS
2002
IEEE
14 years 12 days ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...