Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.

DOI10.4230/LIPIcs.STACS.2011.579zbMath1230.68103OpenAlexW2570007395MaRDI QIDQ3113721

Raghunath Tewari, Raghav Kulkarni, Samir Datta, N. V. Vinodchandran

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_347d.html

zbMATH Keywords

perfect matchingbounded genus graphsisolation problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.