Searching for "Path-Matching Problems." – sorted by Relevance.
-
The Optimal Path-Matching Problem
- The Optimal Path-Matching Problem William H. Cunningham and James F. Geelen Department
- Cited by 24 (2 self) – Add To MetaCart
-
Algebraic structures and algorithms for matching and matroid problems
- of this paper are a new algebraic characterization of basic path-matching problems and an algorithm
- Cited by 5 (0 self) – Add To MetaCart
-
Length-constrained Path-matchings in Graphs
- , and V.S. Mirrokni Abstract The path-matching problem is to nd a set of vertex or edge disjoint paths
- Cited by 1 (1 self) – Add To MetaCart
-
Length-constrained Path-matchings in Graphs
- , and V.S. Mirrokni Abstract The path-matching problem is to nd a set of vertex or edge disjoint paths
- Add To MetaCart
-
The Design and Evaluation of Path Matching Schemes on Compressed Control Flow Traces
- to the path interruption and path context problems, existing pattern matching algorithms, such as the one
- Add To MetaCart
-
The independent even factor problem
- , and polynomial-time solvability of the independent path-matching problem, which generalize those in the matching
- Cited by 1 (1 self) – Add To MetaCart
-
A weighted even factor algorithm
- dual integral polyhedral description, and polynomial-time solvability of the path-matching problem
- Cited by 3 (1 self) – Add To MetaCart
-
Primal
- , alternating path algorithms for solving the weighted matching problem, or methods for optimizing over
- Add To MetaCart
-
A Decade of Combinatorial Optimization
- also describes improvements in solution times for problems such as shortest path and matching problems
- Cited by 1 (0 self) – Add To MetaCart
-
General Techniques for Comparing Unrooted Evolutionary Trees
- and path matching The sub-quadratic time algorithms [3, 4, 5, 7, 12] for the binary MAST problem are based
- Cited by 6 (2 self) – Add To MetaCart

