The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244)
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: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems |
scientific article; zbMATH DE number 37945
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems |
scientific article; zbMATH DE number 37945 |
Statements
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (English)
0 references
28 June 1992
0 references
succinct description of large graphs
0 references
efficient solution of graph problems
0 references
0 references
0.8716228
0 references
0.8716228
0 references
0.86609554
0 references
0.8570368
0 references
