Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210)
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: Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs |
scientific article; zbMATH DE number 7559414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs |
scientific article; zbMATH DE number 7559414 |
Statements
18 July 2022
0 references
logspace computation
0 references
high genus
0 references
matching isolation
0 references
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (English)
0 references
