Recognizing optimal 1-planar graphs in linear time (Q1702117)
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: Recognizing optimal 1-planar graphs in linear time |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing optimal 1-planar graphs in linear time |
scientific article |
Statements
Recognizing optimal 1-planar graphs in linear time (English)
0 references
28 February 2018
0 references
graph drawing
0 references
1-planar graphs
0 references
recognition algorithms
0 references
graph reduction systems
0 references
0 references
0.8276634216308594
0 references
0.8174368143081665
0 references
0.8036104440689087
0 references
0.798626184463501
0 references
0.7907546162605286
0 references