Space complexity of perfect matching in bounded genus bipartite graphs (Q439936): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.11.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1496024985 / rank | |||
Normal rank | |||
Revision as of 03:19, 20 March 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
