The complexity of two graph orientation problems (Q412352)
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 6030389
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of two graph orientation problems |
scientific article; zbMATH DE number 6030389 |
Statements
The complexity of two graph orientation problems (English)
0 references
4 May 2012
0 references
graph orientation
0 references
diameter
0 references
planar graph
0 references
graph minors
0 references
apex graph
0 references
0 references
0.9357077
0 references
0.9126403
0 references
0.90004706
0 references
0.8987151
0 references
0.8977083
0 references
0.8948225
0 references
0.8925877
0 references
0.8922824
0 references
0.89121395
0 references
