Dulmage-Mendelsohn canonical decomposition as a generic pruning technique
From MaRDI portal
Publication:487628
DOI10.1007/s10601-012-9120-4zbMath1309.90116MaRDI QIDQ487628
Publication date: 22 January 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-012-9120-4
graph theory; constraint programming; operations research; global constraints; decomposition theory; matching theory
90C35: Programming involving graphs or networks
Related Items
Gallai-Edmonds decomposition as a pruning technique, Weighted matching as a generic pruning technique applied to optimization constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- A linear-time algorithm for a special case of disjoint set union
- Matching theory
- A permutation-based approach for solving the job-shop problem
- TWO THEOREMS IN GRAPH THEORY
- Coverings of Bipartite Graphs
- An Algorithm for a Minimum Cover of a Graph
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
- On Representatives of Subsets
- Depth-First Search and Linear Graph Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Principles and Practice of Constraint Programming – CP 2004
