The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems
| Author: | T. Lengauer, Klaus WagnerGND |
|---|---|
| Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/15071 |
| ISBN: | 978-3-540-17219-2OPAC |
| ISBN: | 978-3-540-47419-7OPAC |
| Parent Title (English): | Lecture Notes in Computer Science |
| Publisher: | Springer |
| Place of publication: | Berlin |
| Type: | Article |
| Language: | English |
| Year of first Publication: | 1987 |
| Release Date: | 2017/07/21 |
| Volume: | 247 |
| First Page: | 100 |
| Last Page: | 113 |
| Note: | Published in: STACS 87: 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987, conference proceedings, edited by Franz J. Brandenburg, Guy Vidal-Naquet, Martin Wirsing |
| DOI: | https://doi.org/10.1007/BFb0039598 |
| Institutes: | Mathematisch-Naturwissenschaftlich-Technische Fakultät |
| Mathematisch-Naturwissenschaftlich-Technische Fakultät / Institut für Mathematik |
