Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. (Q3113721)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. |
scientific article |
Statements
23 January 2012
0 references
perfect matching
0 references
bounded genus graphs
0 references
isolation problem
0 references
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. (English)
0 references
