Dynamic Matchings in Left Weighted Convex Bipartite Graphs

DOI10.1007/978-3-319-08016-1_30MaRDI QIDQ3188860zbMATH OpenOpenAlexFDO

Authors

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

BSTdynamic matchingimplicit representationmatroidweighted convex bipartite graph

Mathematics Subject Classification ID

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

Recommendations

• Dynamic matchings in left vertex weighted convex bipartite graphs
• Dynamic Matchings in Convex Bipartite Graphs
• Fast dynamic weight matchings in convex bipartite graphs
• Fully dynamic matching in bipartite graphs
• Matchings in node-weighted convex bipartite graphs
• A framework for dynamic matching in weighted graphs
• Optimum matchings in weighted bipartite graphs
• A fast dynamic optimum algorithm for maximum matching in bipartite graphs
• Constrained matching problems in bipartite graphs
• Maintaining approximate maximum weighted matching in fully dynamic graphs

Cited in

(5)

• Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
• Matchings in node-weighted convex bipartite graphs
• Fast dynamic weight matchings in convex bipartite graphs
• Dynamic matchings in left vertex weighted convex bipartite graphs
• Dynamic Matchings in Convex Bipartite Graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188860)