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

[1]  Thomas Lengauer,et al.  Hierarchical planarity testing algorithms , 1989, JACM.

[2]  Thomas Lengauer,et al.  Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs , 1988, SIAM J. Comput..

[3]  Thomas Lengauer,et al.  Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs , 1987, J. Algorithms.

[4]  Mihalis Yannakakis,et al.  A Note on Succinct Representations of Graphs , 1986, Inf. Control..

[5]  Thomas Lengauer,et al.  Exploiting Hierarchy in VLSI Design , 1986, Aegean Workshop on Computing.

[6]  Eli Upfal,et al.  Constructing a perfect matching is in random NC , 1985, STOC '85.

[7]  K. Wagner,et al.  The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract) , 1984, MFCS.

[8]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[9]  Thomas Lengauer,et al.  The complexity of compacting hierarchically specified layouts of integrated circuits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[10]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[11]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[12]  D. Dolev,et al.  On linear area embedding of planar graphs , 1981 .

[13]  Ivan Hal Sudborough,et al.  Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey) , 1981, MFCS.

[14]  Neil Immerman,et al.  Number of Quantifiers is Better Than Number of Tape Cells , 1981, J. Comput. Syst. Sci..

[15]  Ivan Hal Sudborough,et al.  Efficient algorithms for path system problems and applications to alternating and time-space complexity classes , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[16]  Neil Immerman,et al.  Length of predicate calculus formulas as a new complexity measure , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[17]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[18]  I. H. Sudborough.  On Tape-Bounded Complexity Classes and Multihead Finite Automata , 1973, J. Comput. Syst. Sci..

[19]  Walter J. Savitch,et al.  Maze Recognizing Automata and Nondeterministic Tape Complexity , 1973, J. Comput. Syst. Sci..

[20]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[21]  A. K. Chandra,et al.  Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[22]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.