Processing of Hierarchically Defined Graphs and Graph Families

[1]  Egon Wanke,et al.  On the Decidability of Certain Integer Subgraph Problems on Context-Free Graph Languages , 1994, Inf. Comput..

[2]  Egon Wanke,et al.  The Complexity of Connectivity Problems on Context-Free Graph Languages , 1994, J. Comput. Syst. Sci..

[3]  Patrice Quinton,et al.  Computability of recurrence equations , 1993, Theor. Comput. Sci..

[4]  Bruno Courcelle,et al.  Monadic Second-Order Evaluations on Tree-Decomposable Graphs , 1991, Theor. Comput. Sci..

[5]  Egon Wanke,et al.  On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages , 1991, FCT.

[6]  Egon Wanke,et al.  Algorithms for Graph Problems on BNLC Structured Graphs , 1991, Inf. Comput..

[7]  Murali S. Kodialam,et al.  Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming , 1991, SODA '91.

[8]  Egon Wanke,et al.  PLEXUS: Tools for Analyzing Graph Grammars , 1990, Graph-Grammars and Their Application to Computer Science.

[9]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[10]  Edith Cohen,et al.  Recognizing Properties of Periodic Graphs , 1990, Applied Geometry And Discrete Mathematics.

[11]  Egon Wanke,et al.  Undecidability of the Bandwidth Problem on Linear Graph Languages , 1989, Inf. Process. Lett..

[12]  David Fernández-Baca,et al.  Augmentation Problems on Hierarchically Defined Graphs (Preliminary Version) , 1989, WADS.

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

[14]  Annegret Habel,et al.  Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar , 1989, TAPSOFT, Vol.1.

[15]  Edith Cohen,et al.  Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs , 1989, STOC '89.

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

[17]  Thomas Lengauer,et al.  Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) , 1988, ICALP.

[18]  Annegret Habel,et al.  Graph-Theoretic Properties Compatible with Graph Derivations , 1988, WG.

[19]  Thomas Kailath,et al.  Regular iterative algorithms and their implementation on processor arrays , 1988, Proc. IEEE.

[20]  Egon Wanke,et al.  PLEXUS: A System for Implementing Hierarchical Graph Algorithms , 1988, STACS.

[21]  Gregory F. Sullivan,et al.  Detecting cycles in dynamic graphs in polynomial time , 1988, STOC '88.

[22]  Bruno Courcelle,et al.  An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars , 1987, Theor. Comput. Sci..

[23]  Thomas Lengauer,et al.  The Correlation between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems , 1987, J. Comput. Syst. Sci..

[24]  Kenneth Steiglitz,et al.  Testing for cycles in infinite graphs with periodic structure , 1987, STOC.

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

[26]  Annegret Habel,et al.  May we introduce to you: hyperedge replacement , 1986, Graph-Grammars and Their Application to Computer Science.

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

[28]  Grzegorz Rozenberg,et al.  Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity , 1986, Inf. Control..

[29]  W. Pulleyblank.  Progress in combinatorial optimization , 1985 .

[30]  Eitan M. Gurari,et al.  Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem , 1984, J. Algorithms.

[31]  J. Orlin.  Some problems on dynamic/periodic graphs , 1983 .

[32]  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).

[33]  James B. Orlin,et al.  The complexity of dynamic languages and dynamic optimization problems , 1981, STOC '81.

[34]  James B. Saxe,et al.  Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time , 1980, SIAM J. Algebraic Discret. Methods.

[35]  Richard M. Karp,et al.  The Organization of Computations for Uniform Recurrence Equations , 1967, JACM.