scientific article; zbMATH DE number 177465
From MaRDI portal
Publication:4037335
Recommendations
- The complexity of graph languages generated by hyperedge replacement
- Characteristics of graph languages generated by edge replacement
- The subgraph isomorphism problem on a class of hyperedge replacement languages
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- On hyperedge replacement and BNLC graph grammars
- scientific article; zbMATH DE number 219258
- scientific article; zbMATH DE number 522845
- scientific article; zbMATH DE number 4035178
- Efficient recognition algorithms for boundary and linear eNCE graph languages
- scientific article; zbMATH DE number 4087049
Cited in
(13)- Characteristics of graph languages generated by edge replacement
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Uniform parsing for hyperedge replacement grammars
- Between a rock and a hard place -- uniform parsing for hyperedge replacement DAG grammars
- Predictive top-down parsing for hyperedge replacement grammars
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- The use of tree transducers to compute translations between graph algebras
- Efficient recognition algorithms for boundary and linear eNCE graph languages
- Recognising k-connected hypergraphs in cubic time
- Finite automata for efficient graph recognition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037335)
