45 search results - page 3 / 9 » Feedback Vertex Set in Mixed Graphs |
71
Voted
IEICET
2006
15 years 11 days ago
2006
WADS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(ck ·m) time, where m denotes the number of...
112
Voted
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
115
click to vote
JCO
1998
15 years 1 days ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...