Space complexity of perfect matching in bounded genus bipartite graphs (Q439936): Difference between revisions
From MaRDI portal
Latest revision as of 14:21, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Space complexity of perfect matching in bounded genus bipartite graphs |
scientific article |
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