Boundary NLC graph grammars--basic definitions, normal forms, and complexity
Information and Control
Testing for cycles in infinite graphs with periodic structure
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Efficient solution to connectivity problems on hierarchically defined graphs
SIAM Journal on Computing
Hierarchical planarity testing algorithms
Journal of the ACM (JACM)
Undecidability of the bandwidth problem on linear graph languages
Information Processing Letters
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
Easy problems for tree-decomposable graphs
Journal of Algorithms
Algorithms for graph problems on BNLC structured graphs
Information and Computation
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
May we introduce to you: hyperedge replacement
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract)
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Succinct representation of graphs
Succinct representation of graphs
The complexity of connectivity problems on context-free graph languages
Journal of Computer and System Sciences
The complexity of approximating pspace-complete problems for hierarchical specifications
Nordic Journal of Computing
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
| Hi-index | 0.01 |
Efficient ways of analyzing families of graphs that are generated by a certain type of context-free graph grammars are considered. These graph grammars are called cellular graph grammars. They generate the same graph families as hyperedge replacement systems, but are defined in a way that supports complexity analysis. A characteristic called “finiteness” of graph properties are defined, and combinatorial algorithms are presented for deciding whether a graph language generated by a given cellular graph grammar contains a graph with a given finite graph property. Structural parameters are introduced that bound the complexity of the decision procedure and special cases for which the decision can be made in polynomial time are discussed. Extensions to graph grammars that are not context-free are also given. Our results provide explicit and efficient combinatorial algorithms where, so far, only the existence of algorithms has been shown, or the best known algorithms are highly inefficient.