Graphs with small bandwidth and cutwidth
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3745191 (Why is no real title available?)
- Graph minors. I. Excluding a forest
- On the Cutwidth and the Topological Bandwidth of a Tree
- The bandwidth problem and operations on graphs
- The bandwidth problem for graphs and matrices—a survey
- Topological Bandwidth
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
Cited in
(32)- Hardness results for approximating the bandwidth
- Characterizations of \(k\)-cutwidth critical trees
- Lower bounds on treespan
- The cutwidth of trees with diameters at most 4
- Approximating the bandwidth via volume respecting embeddings
- Labeling schemes for weighted dynamic trees
- Characterizing Graphs of Small Carving-Width
- Minimal congestion trees
- The effect of planarization on width
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- scientific article; zbMATH DE number 7236450 (Why is no real title available?)
- On number of leaves and bandwidth of trees
- Distortion lower bounds for line embeddings
- Embedding spanning subgraphs of small bandwidth
- Approximating the bandwidth of caterpillars
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
- Strong SDP based bounds on the cutwidth of a graph
- Multiplicity of finite graphs over the real line
- Skewness of graphs with small cutsets
- The structure of graphs not admitting a fixed immersion
- The Firefighter Problem: A Structural Analysis
- Linear layouts measuring neighbourhoods in graphs
- The effect of planarization on width
- The theory of guaranteed search on graphs
- scientific article; zbMATH DE number 1404133 (Why is no real title available?)
- On upper bounds of bandwidths of trees
- scientific article; zbMATH DE number 812088 (Why is no real title available?)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
- Tree-width, path-width, and cutwidth
- On 3-cutwidth critical graphs
- 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
- The firefighter problem: further steps in understanding its complexity
This page was built for publication: Graphs with small bandwidth and cutwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117949)
