Fast dynamic weight matchings in convex bipartite graphs
DOI10.1007/978-3-662-48054-0_50zbMATH Open1465.68219OpenAlexW2399415748MaRDI QIDQ2946428FDOQ2946428
Authors:
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48054-0_50
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Preserving order in a forest in less than logarithmic time and linear space
- Matchings in node-weighted convex bipartite graphs
- Maximum matching in a convex bipartite graph
- A linear time algorithm for maximum matchings in convex, bipartite graphs
- Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
- Dynamic Matchings in Left Weighted Convex Bipartite Graphs
- Dynamic Matchings in Convex Bipartite Graphs
- Title not available (Why is that?)
- Optimal assignments in an ordered set: An application of matroid theory
Cited In (7)
- Bipartite matching with linear edge weights
- Dynamic Matchings in Left Weighted Convex Bipartite Graphs
- Dynamic Matchings in Convex Bipartite Graphs
- Incremental assignment problem
- Dynamic matchings in left vertex weighted convex bipartite graphs
- Fast primal-dual update against local weight update in linear assignment problem and its application
- Matchings in node-weighted convex bipartite graphs
This page was built for publication: Fast dynamic weight matchings in convex bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946428)
