The complexity of connectivity problems on context-free graph languages
From MaRDI portal
Cites work
- Algorithms for graph problems on BNLC structured garphs
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- Combinatorial properties of boundary NLC graph languages
- Efficient decision procedures for graph properties on context-free graph languages
- Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
- Graph expressions and graph rewritings
- Graph theoretic closure properties of the family of boundary NLC graph languages
- Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
- scientific article; zbMATH DE number 4049105 (Why is no real title available?)
- scientific article; zbMATH DE number 45244 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 965 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Hyperedge replacement: grammars and languages
- Metatheorems for decision problems on hyperedge replacement graph languages
- On the decidability of certain integer subgraph problems on context-free graph languages
- On the structure of node-label-controlled graph languages
- Relationships between nondeterministic and deterministic tape complexities
- Restrictions, extensions, and variations of NLC grammars
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Cited in
(10)- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
- On the decidability of certain integer subgraph problems on context-free graph languages
- Set of memories of a D-graph
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Reachability in graph transformation systems and slice languages
- scientific article; zbMATH DE number 3917735 (Why is no real title available?)
- scientific article; zbMATH DE number 17563 (Why is no real title available?)
- scientific article; zbMATH DE number 1222597 (Why is no real title available?)
- scientific article; zbMATH DE number 1107740 (Why is no real title available?)
- Efficient decision procedures for graph properties on context-free graph languages
This page was built for publication: The complexity of connectivity problems on context-free graph languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333400)
