Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Easy problems for tree-decomposable graphs
Journal of Algorithms
On a monadic NP vs monadic co-NP
Information and Computation
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract)
Proceedings of the Mathematical Foundations of Computer Science 1984
Processing of Hierarchically Defined Graphs and Graph Families
Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative
Tree-partite graphs and the complexity of algorithms
FCT '85 Fundamentals of Computation Theory
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
| Hi-index | 0.00 |
This article concentrates on classes of graphs containing large grids and having a very regular structure. Grid-structured hierarchical graphs are defined in [19] by giving a static graph defining the content of a cell of a d-dimensional grid, repeating this static graph in each cell and by connecting the vertices in cells of a local neighborhood corresponding to a finite transit function in a uniform way. It is shown that for each finitely represented class K of dynamic graphs all monotone graph properties and all first order (FO) problems can be solved in constant time O(1). This result improves the linear time computability of FO problems for graphs of bounded degree from [25].