Improved bounds for bipartite matching on surfaces
type: Item
instance of: scholarly article
zbMATH Open document ID: 1245.68102
author: Samir Datta
author: Arjun Gopalan
author: Raghav Kulkarni
author: Raghunath Tewari
publication date: 2012-08-23T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 6070907
zbMATH Keywords: perfect matching
zbMATH Keywords: graphs on surfaces
zbMATH Keywords: space complexity
zbMATH Keywords: NC
zbMATH Keywords: UL
MaRDI profile type: Publication
DOI: 10.4230/LIPICS.STACS.2012.254
Recommended article: On the matching extendability of graphs in surfaces
Recommended article: On the restricted matching extension of graphs in surfaces
Recommended article: Q4252363
Recommended article: Some results on the matching extendability of graphs in surfaces
Recommended article: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
Recommended article: An improved upper bound for the bondage number of graphs on surfaces
Recommended article: Some Results on Matching in Bipartite Graphs
Recommended article: Bipartite graphs and quasipositive surfaces
Recommended article: Matchings in graphs on non-orientable surfaces
Recommended article: A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
title: Improved bounds for bipartite matching on surfaces
description: scientific article; zbMATH DE number 6070907