The complexity of connectivity problems on context-free graph languages

Authors:
Egon Wanke
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1994

Citing 13
Cited 0

Graph theoretic closure properties of the family of boundary NLC graph languages

Acta Informatica
Combinatorial properties of boundary NLC graph languages

Discrete Applied Mathematics
Efficient solution to connectivity problems on hierarchically defined graphs

SIAM Journal on Computing
Metatheorems for decision problems on hyperedge replacement graph languages

Acta Informatica
The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems

Journal of Computer and System Sciences
Efficient decision procedures for graph properties on context-free graph languages

Journal of the ACM (JACM)
On the decidability of certain integer subgraph problems on context-free graph languages

Information and Computation
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology

Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Apex Graph Grammars

Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a very general frame, we analyze the complexity of connectivity problems on sets of graphs defined by context-free graph rewriting systems under various restrictions. In particular, we show the following results: If L is the set of all context-free graph rewriting systems that define at least one disconnected graph (connected graph, respectively), then L is DEXPTIME-complete. For linear systems or systems that define only finite sets of graphs, L is PSPACE-complete. For linear systems that define finite sets of graphs, L is NP-complete. For deterministic systems the complexity class of L depends on the used graph grammar model. L is P-complete for simple context-free graph rewriting systems as for example hyperedge replacement systems, but NP-complete (co-NP-complete, respectively), for boundary node label controlled graph grammars and more powerful systems.