Dynamic Matchings in Convex Bipartite Graphs

DOI10.1007/978-3-540-74456-6_37zbMath1147.68602OpenAlexW172120053MaRDI QIDQ3525588

Irit Katriel, Kristoffer Arnsfelt Hansen, Loukas Georgiadis, Gerth Stølting Brodal

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_37

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) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (6)

Dynamic matchings in left vertex weighted convex bipartite graphs ⋮ Fast Dynamic Weight Matchings in Convex Bipartite Graphs ⋮ Linear-time algorithm for the paired-domination problem in convex bipartite graphs ⋮ Finding maximum edge bicliques in convex bipartite graphs ⋮ Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs ⋮ Optimal point movement for covering circular regions

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