Pages that link to "Item:Q4248532"
From MaRDI portal
The following pages link to A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs (Q4248532):
Displaying 50 items.
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees (Q327683) (← links)
- Embeddings of circulant networks (Q358657) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Bandwidth of trees of diameter at most 4 (Q427848) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- New classes of extremal graphs with given bandwidth (Q489353) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
- Multiscale approach for the network compression-friendly ordering (Q553960) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Two models of two-dimensional bandwidth problems (Q656608) (← links)
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
- An extremal graph with given bandwidth (Q884479) (← links)
- Bandwidth of the corona of two graphs (Q932628) (← links)
- Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
- Communication tree problems (Q995575) (← links)
- The profile of the Cartesian product of graphs (Q1005223) (← links)
- On explicit formulas for bandwidth and antibandwidth of hypercubes (Q1026164) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- On the profile of the corona of two graphs (Q1029099) (← links)
- Bandwidth of the composition of two graphs. (Q1406563) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Wirelength of hypercubes into certain trees (Q1759856) (← links)
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051) (← links)
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans (Q1944166) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Characterization of the congestion lemma on layout computation (Q2051622) (← links)
- Embedding algorithm of spined cube into grid structure and its wirelength computation (Q2072078) (← links)
- Minimum degree conditions for the strength and bandwidth of graphs (Q2166226) (← links)
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout (Q2201764) (← links)
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures (Q2208343) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- Layout of embedding locally twisted cube into the extended theta mesh topology (Q2413386) (← links)
- Bandwidth of the product of paths of the same length (Q2446900) (← links)
- Embedding of hypercubes into sibling trees (Q2449051) (← links)
- Bandwidth of the strong product of two connected graphs (Q2470005) (← links)
- Profile minimization on compositions of graphs (Q2471064) (← links)
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
- Profile minimization on products of graphs (Q2495515) (← 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)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices (Q2832890) (← links)
- An integer programming model for the Minimum Interval Graph Completion Problem (Q2883618) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- Optimal Embedding of Locally Twisted Cubes into Grids (Q2971629) (← links)
