Output-sensitive algorithm for the edge-width of an embedded graph (Q5405877)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6278565
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Output-sensitive algorithm for the edge-width of an embedded graph |
scientific article; zbMATH DE number 6278565 |
Statements
Output-sensitive algorithm for the edge-width of an embedded graph (English)
0 references
3 April 2014
0 references
computational topology
0 references
edge-width
0 references
embedded graph
0 references
face-width
0 references
surface
0 references
topological graph theory
0 references
0.9505484700202942
0 references
0.8789229393005371
0 references
0.8721737265586853
0 references
0.8297860026359558
0 references
0.8275110721588135
0 references
