Fast Dynamic Weight Matchings in Convex Bipartite Graphs

DOI10.1007/978-3-662-48054-0_50zbMath1465.68219OpenAlexW2399415748MaRDI QIDQ2946428

No author found.

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Preserving order in a forest in less than logarithmic time and linear space
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
• Matchings in Node-Weighted Convex Bipartite Graphs
• Dynamic Matchings in Left Weighted Convex Bipartite Graphs
• Dynamic Matchings in Convex Bipartite Graphs
• Maximum matching in a convex bipartite graph
• Optimal assignments in an ordered set: An application of matroid theory

This page was built for publication: Fast Dynamic Weight Matchings in Convex Bipartite Graphs