1933 search results - page 72 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
134
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
159
Voted
MOR
2000
15 years 3 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
110
Voted
AUSAI
2004
Springer
15 years 8 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
127
Voted
FM
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
152
Voted
PRL
2010
14 years 10 months ago
2010
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...