Gallai-Edmonds decomposition as a pruning technique
From MaRDI portal
Publication:301487
DOI10.1007/s10100-013-0309-4zbMath1339.90322OpenAlexW1980981969MaRDI QIDQ301487
Publication date: 30 June 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-013-0309-4
constraint programmingglobal constraintsdecomposition theoryextreme setsfiltering algorithmsmatching theory
Programming involving graphs or networks (90C35) Convex programming (90C25) Graph algorithms (graph-theoretic aspects) (05C85) Matching models (91B68)
Related Items (2)
Weighted matching as a generic pruning technique applied to optimization constraints ⋮ A note on extreme sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
- An algorithm for computing simple \(k\)-factors
- A linear-time algorithm for a special case of disjoint set union
- Matching structure and the matching lattice
- Graph factors
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Global constraints for round robin tournament scheduling.
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Introducing global constraints in CHIP
- TWO THEOREMS IN GRAPH THEORY
- An Algorithm for a Minimum Cover of a Graph
- Principles of Constraint Programming
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Paths, Trees, and Flowers
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- A Short Proof of the Factor Theorem for Finite Graphs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This page was built for publication: Gallai-Edmonds decomposition as a pruning technique
