Pages that link to "Item:Q3956994"
From MaRDI portal
The following pages link to The bandwidth problem for graphs and matrices—a survey (Q3956994):
Displaying 50 items.
- Bandwidth and low dimensional embedding (Q388456) (← links)
- Cutwidth of triangular grids (Q397153) (← links)
- A bandwidth reduction algorithm for L-shaped and Z-shaped grid structured graphs (Q408436) (← links)
- Bandwidth of trees of diameter at most 4 (Q427848) (← links)
- New classes of extremal graphs with given bandwidth (Q489353) (← links)
- Sequences of radius \(k\) for complete bipartite graphs (Q528554) (← links)
- Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
- Hardness results for approximating the bandwidth (Q619902) (← links)
- Two models of two-dimensional bandwidth problems (Q656608) (← 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)
- A degree sequence method for the cutwidth problem of graphs (Q698370) (← links)
- Investigation of the structure of binary variables (Q750057) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Heuristics for matrix bandwidth reduction (Q858330) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- Edge-bandwidth of grids and tori (Q861250) (← links)
- An extremal graph with given bandwidth (Q884479) (← links)
- Bandwidth of the corona of two graphs (Q932628) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
- The profile of the Cartesian product of graphs (Q1005223) (← links)
- On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
- On the profile of the corona of two graphs (Q1029099) (← links)
- Lower bounds on treespan (Q1044709) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- The bandwidth problem and operations on graphs (Q1082355) (← links)
- On the problem of bandsize (Q1089353) (← links)
- On embedding graphs in trees (Q1103631) (← links)
- Graphs with small bandwidth and cutwidth (Q1117949) (← links)
- On the size of graphs of a given bandwidth (Q1121919) (← links)
- Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
- Bandwidth of theta graphs with short paths (Q1197053) (← links)
- Parallel multigrid preconditioning of the conjugate gradient method for systems of subsurface hydrology (Q1289127) (← links)
- On number of leaves and bandwidth of trees (Q1299831) (← links)
- A new matrix bandwidth reduction algorithm (Q1306383) (← links)
- Decompositions into linear forests and difference labelings of graphs (Q1327218) (← links)
- Profile minimization problem for matrices and graphs (Q1327828) (← links)
- On bandwidth-2 graphs (Q1348371) (← links)
- On the bandwidth of convex triangulation meshes (Q1367046) (← 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)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- On the bandwidth of a Hamming graph (Q1400004) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- Bandwidth of the composition of two graphs. (Q1406563) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- GRASP and path relinking for the matrix bandwidth minimization. (Q1417505) (← links)
