Processing of Hierarchically Defined Graphs and Graph Families

Authors:
Franz Höfting;Thomas Lengauer;Egon Wanke
Affiliations:
-;-;-
Venue:
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Year:
1992

Citing 0
Cited 5

Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of approximating pspace-complete problems for hierarchical specifications

Nordic Journal of Computing
Towards a Predictive Computational Complexity Theory

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Predecessor existence problems for finite discrete dynamical systems

Theoretical Computer Science
Easy problems for grid-structured graphs

FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics

Quantified Score

Hi-index	0.00

Visualization

Abstract