248 search results - page 7 / 50 » Parameterized Algorithms for Directed Maximum Leaf Problems |
ACL
2004
14 years 11 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
98
Voted
ICGA
1993
14 years 10 months ago
1993
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
ALGORITHMICA
2005
14 years 9 months ago
2005
A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Gi...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...