The optimal path-matching problem

DOI10.1007/BF01215915MaRDI QIDQ1272178zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matroidpath-matching

Mathematics Subject Classification ID

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)

Recommendations

• Matching, matroids, and extensions
• scientific article; zbMATH DE number 2086910
• A note on the separation problem for the matching matroid
• scientific article; zbMATH DE number 3150
• scientific article; zbMATH DE number 1161279

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• A separation algorithm for the matchable set polytope
• Maximum matching and a polyhedron with 0,1-vertices
• Odd Minimum Cut-Sets and b-Matchings
• Paths, Trees, and Flowers
• Short proofs on the matching polyhedron
• Systems of distinct representatives and linear algebra
• The Factorization of Linear Graphs
• The ellipsoid method and its consequences in combinatorial optimization
• The perfectly matchable subgraph polytope of an arbitrary graph
• Transversals and matroid partition

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
• scientific article; zbMATH DE number 5284413 (Why is no real title available?)
• 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
• A note on path-matchings
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids

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)