Space complexity of perfect matching in bounded genus bipartite graphs (Q439936)
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: Space complexity of perfect matching in bounded genus bipartite graphs |
scientific article; zbMATH DE number 6067703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space complexity of perfect matching in bounded genus bipartite graphs |
scientific article; zbMATH DE number 6067703 |
Statements
Space complexity of perfect matching in bounded genus bipartite graphs (English)
0 references
17 August 2012
0 references
space complexity
0 references
perfect matching
0 references
topological graph theory
0 references
0 references
0.9958096146583556
0 references
0.8875962495803833
0 references
0.8165815472602844
0 references
0.8043249249458313
0 references
0.8040060997009277
0 references
