The optimal path-matching problem
DOI10.1007/BF01215915zbMATH Open0902.05056OpenAlexW3160322950MaRDI QIDQ1272178FDOQ1272178
Authors: William H. Cunningham, James F. Geelen 
Publication date: 23 November 1998
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01215915
Recommendations
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- The ellipsoid method and its consequences in combinatorial optimization
- Transversals and matroid partition
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Odd Minimum Cut-Sets and b-Matchings
- Systems of distinct representatives and linear algebra
- A separation algorithm for the matchable set polytope
- The perfectly matchable subgraph polytope of an arbitrary graph
- Short proofs on the matching polyhedron
Cited In (22)
- The exact path length problem.
- Matchings of cycles and paths in directed graphs
- Algebraic algorithms for linear matroid parity problems
- A weighted even factor algorithm
- Spectral aspects of symmetric matrix signings
- Note on the path‐matching formula
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- Matroid bases with cardinality constraints on the intersection
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Matching, matroids, and extensions
- On the maximum even factor in weakly symmetric graphs
- The quickest path problem
- Even factors, jump systems, and discrete convexity
- A weighted independent even factor algorithm
- Length-constrained path-matchings in graphs
- Title not available (Why is that?)
- Path-value functions for which Dijkstra's algorithm returns optimal mapping
- Facets of the independent path-matching polytope
- Spectral aspects of symmetric matrix signings
- The unimodular intersection problem
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- A note on path-matchings
This page was built for publication: The optimal path-matching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272178)
