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.
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q1978696) (← links)
- An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method (Q1993591) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Metaheuristic algorithms for the bandwidth reduction of large-scale matrices (Q2136166) (← links)
- Minimum degree conditions for the strength and bandwidth of graphs (Q2166226) (← links)
- Assignment problem with conflicts (Q2273673) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- On the bandwidth of the Kneser graph (Q2357135) (← links)
- Variable neighbourhood search for bandwidth reduction (Q2379517) (← links)
- Particle swarm optimization and hill climbing for the bandwidth minimization problem (Q2383955) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- A branch and bound algorithm for the matrix bandwidth minimization (Q2462146) (← links)
- Cyclic bandwidth with an edge added (Q2462360) (← links)
- An improved simulated annealing algorithm for bandwidth minimization (Q2464218) (← links)
- Bandwidth of the strong product of two connected graphs (Q2470005) (← links)
- On the edge-bandwidth of graph products (Q2503283) (← links)
- Linear layout of directed grid graph (Q2516509) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- (Q2741348) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete (Q3026359) (← links)
- A Quartic Kernel for Pathwidth-One Vertex Deletion (Q3057625) (← links)
- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion (Q3058695) (← links)
- GRASP with path relinking heuristics for the antibandwidth problem (Q3100697) (← links)
- Graphs, Vectors, and Matrices (Q3178747) (← links)
- Estimating spatial covariance using penalised likelihood with weighted<i>L</i><sub>1</sub>penalty (Q3182743) (← links)
- A general strategy on the bandwidth minimization (BM) problem (Q3330391) (← links)
- Packing of (0, 1)-matrices (Q3423133) (← links)
- Edge Addition Number of Cartesian Product of Paths and Cycles (Q3439378) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- An Exponential Time 2-Approximation Algorithm for Bandwidth (Q3656860) (← links)
- On the Cutwidth and the Topological Bandwidth of a Tree (Q3679205) (← links)
- Topological Bandwidth (Q3691781) (← links)
- Linear arrangement problems on recursively partitioned graphs (Q3778551) (← links)
- A variation on the min cut linear arrangement problem (Q3785979) (← links)
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2 (Q3956996) (← links)
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time (Q3960121) (← links)
- Bandwidth Minimization: An approximation algorithm for caterpillars (Q3979607) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- Self‐clique graphs and matrix permutations (Q4446891) (← links)
- (Q4518334) (← links)
- Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
- Optimal Numberings of an $N \times N$ Array (Q4726293) (← links)
- Graph layout problems (Q5096816) (← links)