Pages that link to "Item:Q1333400"
From MaRDI portal
The following pages link to The complexity of connectivity problems on context-free graph languages (Q1333400):
Displaying 6 items.
- NP-completeness of \(k\)-connected hyperedge-replacement languages of order \(k\) (Q1209328) (← links)
- On the decidability of certain integer subgraph problems on context-free graph languages (Q1333275) (← links)
- Set of memories of a D-graph (Q1759072) (← links)
- The complexity of the \(K_{n,n}\)-problem for node replacement graph languages (Q1854438) (← links)
- The complexity of connectivity problems on context-free graph languages (Q3974888) (← links)
- (Q4218137) (← links)