Processing of hierarchically defined graphs and graph families

This publication has 20 references indexed in Scilit:

• The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
  Information and Computation, 1990
• Graph-theoretic properties compatible with graph derivations
  Published by Springer Nature ,1989
• Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
  Published by Association for Computing Machinery (ACM) ,1989
• Detecting cycles in dynamic graphs in polynomial time
  Published by Association for Computing Machinery (ACM) ,1988
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
  Theoretical Computer Science, 1987
• Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
  Journal of Algorithms, 1987
• Testing for cycles in infinite graphs with periodic structure
  Published by Association for Computing Machinery (ACM) ,1987
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
  Journal of Algorithms, 1984
• The complexity of compacting hierarchically specified layouts of integrated circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• The Organization of Computations for Uniform Recurrence Equations
  Journal of the ACM, 1967