A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

Conference proceeding

Open access

Meena Mahajan and Kasturi Varadarajan

Proceedings of the thirty-second annual ACM symposium on theory of computing, pp.351-357

STOC '00

05/01/2000

DOI: 10.1145/335305.335346

Files and links (1)

url

https://doi.org/10.1145/335305.335346View

Published (Version of record) Open Access

Title: Subtitle: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
Creators: Meena Mahajan - Institute of Mathematical Sciences
Kasturi Varadarajan - Tata Institute of Fundamental Research
Resource Type: Conference proceeding
Publication Details: Proceedings of the thirty-second annual ACM symposium on theory of computing, pp.351-357
Series: STOC '00
DOI: 10.1145/335305.335346
ISSN: 0737-8017
Publisher: ACM
Language: English
Date published: 05/01/2000
Academic Unit: Computer Science
Record Identifier: 9984259440202771

20 Record Views