Efficient algorithms for maximum weight matchings in general graphs with small edge weights
From MaRDI portal
Publication:5743485
Recommendations
Cites work
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 177842 (Why is no real title available?)
- scientific article; zbMATH DE number 3637616 (Why is no real title available?)
- scientific article; zbMATH DE number 3220175 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 3393943 (Why is no real title available?)
- A decomposition theorem for maximum weight bipartite matchings
- A linear-time algorithm for a special case of disjoint set union
- A scaling algorithm for maximum weight matching in bipartite graphs
- A shortest augmenting path method for solving minimal perfect matching problems
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Algorithms for dense graphs and networks on the random access computer
- Algorithms – ESA 2004
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Clique partitions, graph compression and speeding-up algorithms
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Faster Scaling Algorithms for Network Problems
- Faster scaling algorithms for general graph matching problems
- Global Price Updates Help
- Matching theory
- Matrix multiplication via arithmetic progressions
- Maximum matching and a polyhedron with 0,1-vertices
- Maximum matchings in planar graphs via Gaussian elimination
- Maximum skew-symmetric flows
- Maximum weight bipartite matching in matrix multiplication time
- Network flows. Theory, algorithms, and applications.
- On some techniques useful for solution of transportation network problems
- Paths, Trees, and Flowers
- Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs
- Scaling Algorithms for the Shortest Paths Problem
- The Factorization of Linear Graphs
Cited in
(9)- Efficient algorithms for finding maximum matching in graphs
- Fully dynamic maximal matching in \(O(\log n)\) update time (corrected version)
- A simple reduction from maximum weight matching to maximum cardinality matching
- Two dimensional maximum weight matching using Manhattan topology
- New algorithms for maximum weight matching and a decomposition theorem
- Fully dynamic maximal matching in \(O(\log n)\) update time
- Efficient algorithms for variants of weighted matching and assignment problems
- Solving maximum weighted matching on large graphs with deep reinforcement learning
- Output sensitive fault tolerant maximum matching
This page was built for publication: Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743485)
