Pages that link to "Item:Q3960121"
From MaRDI portal
The following pages link to Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time (Q3960121):
Displaying 7 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- Token sliding on split graphs (Q2048202) (← links)
