Pages that link to "Item:Q3960121"
From MaRDI portal
The following pages link to Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time (Q3960121):
Displaying 39 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Two-Dimensional partitioning problems (Q671423) (← links)
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- Undecidability of the bandwidth problem on linear graph languages (Q908714) (← links)
- The complexity of finding uniform emulations on paths and ring networks (Q918210) (← links)
- Bandwidths and profiles of trees (Q1073038) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- On the problem of bandsize (Q1089353) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- Approximating the bandwidth via volume respecting embeddings (Q1577009) (← links)
- Hardness results on the gapped consecutive-ones property problem (Q1759853) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- Bandwidth and pebbling (Q1838912) (← links)
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051) (← links)
- Token sliding on split graphs (Q2048202) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Approximating the bandwidth of caterpillars (Q2391175) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- On the gapped consecutive-ones property (Q2851450) (← links)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- Topological Bandwidth (Q3691781) (← links)
- Linear arrangement problems on recursively partitioned graphs (Q3778551) (← links)
- Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607) (← links)
- Self‐clique graphs and matrix permutations (Q4446891) (← links)
- Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- Retracting Graphs to Cycles (Q5091228) (← links)
- Critical elements in combinatorially closed families of graph classes (Q5269161) (← links)
- On semidefinite programming bounds for graph bandwidth (Q5299908) (← links)
- Faster Exact Bandwidth (Q5302047) (← links)
- Parameterized problems complete for nondeterministic FPT time and logarithmic space (Q6614886) (← links)
