A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract). Mahajan, M. & Varadarajan, K. R. In Proceedings of Symposium on the Theory of Computing (STOC), pages 351-357, 2000.
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) [link]Paper  bibtex   
@inproceedings{ dblp3324186,
  title = {A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)},
  author = {Meena Mahajan and Kasturi R. Varadarajan},
  author_short = {Mahajan, M. and Varadarajan, K. R.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2000},
  key = {dblp3324186},
  id = {dblp3324186},
  biburl = {http://www.dblp.org/rec/bibtex/conf/stoc/MahajanV00},
  url = {http://doi.acm.org/10.1145/335305.335346},
  conference = {STOC},
  pages = {351-357},
  text = {STOC 2000:351-357},
  booktitle = {Proceedings of Symposium on the Theory of Computing (STOC)}
}

Downloads: 0