Pages that link to "Item:Q685463"
From MaRDI portal
The following pages link to Recognising \(k\)-connected hypergraphs in cubic time (Q685463):
Displayed 6 items.
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs (Q1960417) (← links)
- Spreading linear triple systems and expander triple systems (Q2198982) (← 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)