Deterministically isolating a perfect matching in bipartite planar graphs (Q1959397)
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 5796572
| 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 5796572 |
Statements
Deterministically isolating a perfect matching in bipartite planar graphs (English)
0 references
6 October 2010
0 references
isolation lemma
0 references
deterministic isolation
0 references
perfect matching
0 references
planar graphs
0 references
NC
0 references
0 references
0.9733635187149048
0 references
0.8519220948219299
0 references
0.8387137055397034
0 references
0.8264208436012268
0 references
0.816992998123169
0 references
