Blossom V: A new implementation of a minimum cost perfect matching algorithm
From MaRDI portal
Publication:734352
DOI10.1007/S12532-009-0002-8zbMATH Open1171.05429OpenAlexW2164424155MaRDI QIDQ734352FDOQ734352
Publication date: 20 October 2009
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-009-0002-8
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
- Recursive Star-Tree Parallel Data Structure
- Computing Minimum-Weight Perfect Matchings
- Maximum matching and a polyhedron with 0,1-vertices
- Solving (large scale) matching problems combinatorially
- The pairing heap: A new form of self-adjusting heap
- An analysis of alternative strategies for implementing matching algorithms
- Title not available (Why is that?)
- On the use of optimal fractional matchings for solving the (integer) matching problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (40)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Fast algorithms for the undirected negative cost cycle detection problem
- OAR lib: an open source arc routing library
- Data Reduction for Maximum Matching on Real-World Graphs
- Implementation of O ( nm log n ) weighted matchings in general graphs
- Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
- An algorithm for flexible transshipments with perfect synchronization
- A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
- Optimal Sokoban solving using pattern databases with specific domain knowledge
- Surface code quantum computing by lattice surgery
- Fault-tolerant quantum error correction for non-abelian anyons
- On vertex independence number of uniform hypergraphs
- Districting for Arc Routing
- Logical error rate scaling of the toric code
- Fast decoders for qudit topological codes
- Topological quantum error correction in the Kitaev honeycomb model
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- Title not available (Why is that?)
- The role of entropy in topological quantum error correction
- Approximation algorithms in combinatorial scientific computing
- On matchings, T‐joins, and arc routing in road networks
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
- Using well-solvable minimum cost exact covering for VLSI clock energy minimization
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Blossom V
- Revisiting a cutting-plane method for perfect matchings
- A Hybrid Approach to Fast Indirect Quadrilateral Mesh Generation
- Learning time-dependent noise to reduce logical errors: real time error rate estimation in quantum error correction
- Clustering analysis of a dissimilarity: a review of algebraic and geometric representation
- On optimal flip-flop grouping for VLSI power minimization
- Integer Programming and Combinatorial Optimization
- Improving a constructive heuristic for the general routing problem
- Approximating the metric TSP in linear time
- A magic state’s fidelity can be superior to the operations that created it
- A probability metrics approach for reducing the bias of optimality gap estimators in two-stage stochastic linear programming
- Computing in combinatorial optimization
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem
- A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
- Computing Minimum-Weight Perfect Matchings
- Capacitated arc routing problem with deadheading demands
Uses Software
This page was built for publication: Blossom V: A new implementation of a minimum cost perfect matching algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734352)
