The Correlation between the Complexities of the Nonhierarchical and 
Hierarchical Versions of Graph Problems

Lengauer, Thomas; Wagner, Klaus W.

doi:10.1016/0022-0000(92)90004-3

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

https://www.sciencedirect.com/science/article/pii/0022000092900043?via%3Dihub
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Lengauer, T., & Wagner, K. W. (1992). The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. Journal of Computer and System Sciences, 44(1), 63-93. doi:10.1016/0022-0000(92)90004-3.

Cite as: https://hdl.handle.net/21.11116/0000-000F-908F-D

Abstract

There is no abstract available