Complexity Results for Bandwidth Minimization
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
- Embeddings of binary trees in lines
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Complete problems for space bounded subclasses of NP
- Bandwidths and profiles of trees
- The bandwidth problem and operations on graphs
- On the problem of bandsize
- Finding the minimum bandwidth of an interval graph
- Bounds on the convex label number of trees
- On the complexity of loading shallow neural networks
- The complexity of minimizing wire lengths in VLSI layouts
- Min Cut is NP-complete for edge weighted trees
- Data encodings and their costs
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Optimal linear labelings and eigenvalues of graphs
- Bandwidth of theta graphs with short paths
- On the complexity of tree embedding problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- On number of leaves and bandwidth of trees
- Decompositions into linear forests and difference labelings of graphs
- On bandwidth-2 graphs
- Restrictions of minimum spanner problems
- Harper-type lower bounds and the bandwidths of the compositions of graphs
- Helicopter search problems, bandwidth and pathwidth
- Bandwidth of the composition of two graphs.
- GRASP and path relinking for the matrix bandwidth minimization.
- Computing Prüfer codes efficiently in parallel
- 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
- Approximating the bandwidth via volume respecting embeddings
- The achromatic number of bounded degree trees
- Bandwidth and density for block graphs
- Mock threshold graphs
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
- Bandwidth contrained NP-complete problems
- Bandwidth and pebbling
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
- On bandwidth and edgesum for the composition of two graphs
- On upper bounds of bandwidths of trees
- Trimming of graphs, with application to point labeling
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
- Minimum degree conditions for the strength and bandwidth of graphs
- On the bandwidth of the Kneser graph
- Variable neighbourhood search for bandwidth reduction
- Memory management optimization problems for integrated circuit simulators
- A branch and bound algorithm for the matrix bandwidth minimization
- Cyclic bandwidth with an edge added
- An improved simulated annealing algorithm for bandwidth minimization
- Bandwidth of the strong product of two connected graphs
- A study on cyclic bandwidth sum
- Lower bounds for the bandwidth problem
- Approximating bandwidth by mixing layouts of interval graphs
- Matrix relaxations in combinatorial optimization
- Bandwidth of chain graphs
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Sequences of radius \(k\) for complete bipartite graphs
- A general strategy on the bandwidth minimization (BM) problem
- On Harpers' Result Concerning the Bandwidths of Graphs
- Edge Addition Number of Cartesian Product of Paths and Cycles
- Complexity and Algorithms for Well-Structured k-SAT Instances
- An exponential time 2-approximation algorithm for bandwidth
- On the Cutwidth and the Topological Bandwidth of a Tree
- Topological Bandwidth
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- A variation on the min cut linear arrangement problem
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
- An exponential time 2-approximation algorithm for bandwidth
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Bandwidth Minimization: An approximation algorithm for caterpillars
- Bandwidth of trees of diameter at most 4
- A combinatorial optimization algorithm for solving the branchwidth problem
- scientific article; zbMATH DE number 1114254 (Why is no real title available?)
- Self‐clique graphs and matrix permutations
- Counting Unlabelled Subtrees of a Tree is #P-complete
- scientific article; zbMATH DE number 1533071 (Why is no real title available?)
- Computing k-atomicity in polynomial time
- Graph layout problems
- Sequences of radius \(k\) for complete bipartite graphs
- On semidefinite programming bounds for graph bandwidth
- Faster Exact Bandwidth
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
- Optimal arrangement of data in a tree directory
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
- Tangle bases: Revisited
- Approximating the bandwidth for asteroidal triple-free graphs
- Parameterized algorithms for minimum sum vertex cover
- Robust two-dose vaccination schemes and the directed \(b\)-matching problem
- Approximation algorithms for the bandwidth minimization problem for a large class of trees
- On bandwidth for the tensor product of paths and cycles
- Bandwidth parameterized by cluster vertex deletion number
- Complexity of the directed robust b-matching problem and its variants on different graph classes
- Bandwidth parameterized by cluster vertex deletion number
- Exact and approximate digraph bandwidth
- Parameterized algorithms for minimum sum vertex cover
- Exact and approximate bandwidth
- Single machine scheduling with precedence constraints and bounded maximum delay value
- A probabilistic algorithm for optimal linear arrangements
This page was built for publication: Complexity Results for Bandwidth Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4165413)
