Algorithms for the edge-width of an embedded graph (Q419374)
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: Algorithms for the edge-width of an embedded graph |
scientific article; zbMATH DE number 6036381
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the edge-width of an embedded graph |
scientific article; zbMATH DE number 6036381 |
Statements
Algorithms for the edge-width of an embedded graph (English)
0 references
18 May 2012
0 references
topological graph theory
0 references
computational topology
0 references
edge-width
0 references
face-width
0 references
embedded graph
0 references
0 references
0.9505484700202942
0 references
0.9011707901954652
0 references
0.8975377678871155
0 references
0.8660826683044434
0 references
0.8611913323402405
0 references
