Computing Maximum Non-crossing Matching in Convex Bipartite Graphs

DOI10.1007/978-3-642-29700-7_10zbMath1304.05131OpenAlexW2290593817MaRDI QIDQ2897986

Xiaomin Liu, Haitao Wang, Danny Z. Chen

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_10

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Computing Maximum Non-crossing Matching in Convex Bipartite Graphs