Deterministically isolating a perfect matching in bipartite planar graphs (Q4910722)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6146458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministically isolating a perfect matching in bipartite planar graphs |
scientific article; zbMATH DE number 6146458 |
Statements
19 March 2013
0 references
0.9733635187149048
0 references
0.860498309135437
0 references
0.8515022993087769
0 references
0.831271231174469
0 references
0.8298000693321228
0 references
