Pages that link to "Item:Q3026359"
From MaRDI portal
The following pages link to The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359):
Displaying 50 items.
- Bandwidth of chain graphs (Q293476) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Bandwidth of trees of diameter at most 4 (Q427848) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- Exact and approximate bandwidth (Q708223) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- A fixed-parameter tractability result for multicommodity demand flow in trees (Q1045910) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Bandwidth of theta graphs with short paths (Q1197053) (← links)
- Embedding ladders and caterpillars into the hypercube (Q1392524) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← 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)
- Bandwidth and density for block graphs (Q1584358) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- Cyclic bandwidth with an edge added (Q2462360) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- Approximating bandwidth by mixing layouts of interval graphs (Q2741348) (← links)
- Packing of (0, 1)-matrices (Q3423133) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars (Q3465943) (← links)
- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs (Q3512470) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Faster Exact Bandwidth (Q5302047) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
- Algorithmic Applications in Management (Q5710139) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
