The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems
- 31 January 2006
- book chapter
- Published by Springer Nature
- p. 100-113
- https://doi.org/10.1007/bfb0039598
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A note on succinct representations of graphsInformation and Control, 1986
- The complexity of combinatorial problems with succinct input representationActa Informatica, 1986
- Exploiting hierarchy in VLSI designPublished by Springer Nature ,1986
- Hierarchical planarity testing algorithmsPublished by Springer Nature ,1986
- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphsPublished by Springer Nature ,1986
- The complexity of problems concerning graphs with regularitiesPublished by Springer Nature ,1984
- Succinct representations of graphsInformation and Control, 1983
- The complexity of compacting hierarchically specified layouts of integrated circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972