scientific article; zbMATH DE number 7053362
From MaRDI portal
Publication:5743485
zbMath1423.05172MaRDI QIDQ5743485
Chien-Chung Huang, Telikepalli Kavitha
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095226
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Two dimensional maximum weight matching using Manhattan topology ⋮ A simple reduction from maximum weight matching to maximum cardinality matching ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) ⋮ Fully Dynamic Maximal Matching in $O(\log n)$ Update Time ⋮ Output sensitive fault tolerant maximum matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Maximum weight bipartite matching in matrix multiplication time
- A linear-time algorithm for a special case of disjoint set union
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Clique partitions, graph compression and speeding-up algorithms
- Algorithms for dense graphs and networks on the random access computer
- Maximum matchings in planar graphs via Gaussian elimination
- A Decomposition Theorem for Maximum Weight Bipartite Matchings
- Perfect matchings in o( n log n ) time in regular bipartite graphs
- A shortest augmenting path method for solving minimal perfect matching problems
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- Faster scaling algorithms for general graph matching problems
- Global Price Updates Help
- Faster Scaling Algorithms for Network Problems
- Scaling Algorithms for the Shortest Paths Problem
- Paths, Trees, and Flowers
- Algorithms – ESA 2004
- Maximum matching and a polyhedron with 0,1-vertices
- On some techniques useful for solution of transportation network problems
- The Factorization of Linear Graphs
- Maximum skew-symmetric flows
This page was built for publication:
