Pages that link to "Item:Q1117949"
From MaRDI portal
The following pages link to Graphs with small bandwidth and cutwidth (Q1117949):
Displaying 33 items.
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- The structure of graphs not admitting a fixed immersion (Q473098) (← links)
- The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Multiplicity of finite graphs over the real line (Q743684) (← links)
- Distortion lower bounds for line embeddings (Q975439) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Lower bounds on treespan (Q1044709) (← links)
- On number of leaves and bandwidth of trees (Q1299831) (← links)
- Skewness of graphs with small cutsets (Q1401554) (← links)
- On 3-cutwidth critical graphs (Q1420615) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← 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)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Minimal congestion trees (Q1877665) (← links)
- On upper bounds of bandwidths of trees (Q1899015) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- Characterizations of \(k\)-cutwidth critical trees (Q2410043) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Labeling schemes for weighted dynamic trees (Q2464140) (← links)
- Linear layouts measuring neighbourhoods in graphs (Q2502893) (← links)
- The Firefighter Problem: A Structural Analysis (Q2946017) (← links)
- Characterizing Graphs of Small Carving-Width (Q3167377) (← links)
- Embedding spanning subgraphs of small bandwidth (Q3503507) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- (Q4853762) (← links)
- (Q4937814) (← links)
- The Effect of Planarization on Width (Q4961755) (← links)
- (Q5115814) (← links)
- Strong SDP based bounds on the cutwidth of a graph (Q6065655) (← links)