Algorithms for graphs embeddable with few crossings per edge (Q2461632): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q30053231, #quickstatements; #temporary_batch_1712272666262 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-007-0010-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-007-0010-X / rank | |||
Normal rank | |||
Latest revision as of 19:08, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for graphs embeddable with few crossings per edge |
scientific article |
Statements
Algorithms for graphs embeddable with few crossings per edge (English)
0 references
28 November 2007
0 references
