Pages that link to "Item:Q6102320"
From MaRDI portal
The following pages link to Approximating the bandwidth for asteroidal triple-free graphs (Q6102320):
Displayed 14 items.
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- Selected papers in honor of Manuel Blum on the occasion of his 60th birthday. Selected papers from the international conference in Theoretical Computer Science, Hong Kong, April 20-24, 1998 (Q1572590) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Asteroidal triples of moplexes (Q5939228) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)