1327 search results - page 39 / 266 » Path following algorithm for the graph matching problem |
113
click to vote
JOIN
2007
15 years 1 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
106
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
SODA
2008
ACM
15 years 3 months ago
2008
ACM
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
105
click to vote
ATMOS
2010
15 years 19 days ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
109
click to vote
IWPEC
2009
Springer
15 years 8 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...