Pages that link to "Item:Q4165413"
From MaRDI portal
The following pages link to Complexity Results for Bandwidth Minimization (Q4165413):
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)
- Sequences of radius \(k\) for complete bipartite graphs (Q528554) (← 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)
- Exact and approximate bandwidth (Q708223) (← links)
- Bounds on mincut for Cayley graphs over Abelian groups (Q733724) (← links)
- On minimizing width in linear layouts (Q751660) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- The bandwidth problem for distributive lattices of breadth 3 (Q802635) (← links)
- Lattice bandwidth of random graphs (Q810061) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- An extremal graph with given bandwidth (Q884479) (← links)
- The complexity of power indexes with graph restricted coalitions (Q898757) (← links)
- Routing with critical paths (Q910228) (← links)
- The complexity of finding uniform emulations on paths and ring networks (Q918210) (← links)
- Bandwidth of the corona of two graphs (Q932628) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- A note on the subgraphs of the (\(2\times \infty \))-grid (Q960965) (← links)
- Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- Embeddings of binary trees in lines (Q1058856) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey (Q1062758) (← 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)
- 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)
- On the complexity of loading shallow neural networks (Q1105389) (← 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)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- Bandwidth of theta graphs with short paths (Q1197053) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- On a pattern sequencing problem to minimize the maximum number of open stacks (Q1278124) (← links)
- On number of leaves and bandwidth of trees (Q1299831) (← links)
- Decompositions into linear forests and difference labelings of graphs (Q1327218) (← links)
- On bandwidth-2 graphs (Q1348371) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Harper-type lower bounds and the bandwidths of the compositions of graphs (Q1381861) (← links)
