The following pages link to (Q4037335):
Displaying 11 items.
- Recognising \(k\)-connected hypergraphs in cubic time (Q685463) (← links)
- Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Uniform parsing for hyperedge replacement grammars (Q2656168) (← links)
- Predictive Top-Down Parsing for Hyperedge Replacement Grammars (Q2947208) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- The use of tree transducers to compute translations between graph algebras (Q4645277) (← links)
- Efficient recognition algorithms for boundary and linear eNCE graph languages (Q5941743) (← links)
