Dynamic Matchings in Left Weighted Convex Bipartite Graphs

DOI10.1007/978-3-319-08016-1_30zbMath1407.68378OpenAlexW1944905150MaRDI QIDQ3188860

No author found.

Publication date: 2 September 2014

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08016-1_30

zbMATH Keywords

matroidBSTdynamic matchingimplicit representationweighted convex bipartite graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (2)

Dynamic matchings in left vertex weighted convex bipartite graphs ⋮ Fast Dynamic Weight Matchings in Convex Bipartite Graphs

This page was built for publication: Dynamic Matchings in Left Weighted Convex Bipartite Graphs