A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (Q3192003)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) |
scientific article |
Statements
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (English)
0 references
26 September 2014
0 references
