Pages that link to "Item:Q1223124"
From MaRDI portal
The following pages link to The NP-completeness of the bandwidth minimization problem (Q1223124):
Displayed 50 items.
- Bandwidth of chain graphs (Q293476) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs (Q528766) (← links)
- Adaptive memory programming for matrix bandwidth minimization (Q541991) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Bandwidth on AT-free graphs (Q650939) (← links)
- Bandwidth of graphs resulting from the edge clique covering problem (Q668017) (← links)
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- On bandwidth for the tensor product of paths and cycles (Q678881) (← links)
- Mapping \(n\) grid points onto a square forces an arbitrarily large Lipschitz constant (Q724264) (← links)
- An evaluation of low-cost heuristics for matrix bandwidth and profile reductions (Q725777) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- An extremal graph with given bandwidth (Q884479) (← links)
- Bandwidth of the corona of two graphs (Q932628) (← links)
- The simultaneous consecutive ones problem (Q1019172) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- Bandwidths and profiles of trees (Q1073038) (← links)
- The bandwidth problem and operations on graphs (Q1082355) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Data encodings and their costs (Q1139942) (← links)
- Complexity of representation of graphs by set systems (Q1158768) (← links)
- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space (Q1168735) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- Bandwidth of theta graphs with short paths (Q1197053) (← links)
- Scheduling real-time computations with separation constraints (Q1198025) (← links)
- The online graph bandwidth problem (Q1198951) (← links)
- A generalized insertion algorithm for the seriation problem (Q1328867) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- Harper-type lower bounds and the bandwidths of the compositions of graphs (Q1381861) (← links)
- Bandwidth of the composition of two graphs. (Q1406563) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← 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)
- Bounding the bandwidths for graphs (Q1583541) (← links)
- Bandwidth and density for block graphs (Q1584358) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion (Q1759683) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)