A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (Q3192003)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) |
scientific article; zbMATH DE number 6348003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) |
scientific article; zbMATH DE number 6348003 |
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
0.9385074377059937
0 references
0.9110708832740784
0 references
0.8911295533180237
0 references
0.864606499671936
0 references
