Pages that link to "Item:Q4719340"
From MaRDI portal
The following pages link to Approximating the Bandwidth for Asteroidal Triple-Free Graphs (Q4719340):
Displaying 17 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Algorithms for graphs with small octopus (Q1421464) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- On the domination search number (Q1811076) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
