A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
From MaRDI portal
Publication:4248532
Recommendations
Cites work
- scientific article; zbMATH DE number 3791534 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous Equations
- Mapping the genome
- The Categorical Product of Graphs
Cited in
(63)- Maximum incomplete recursive circulants in graph embeddings
- Embedding augmented cube into certain trees and windmill graphs
- Minimum Linear Arrangement of Generalized Sierpinski Graphs
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem
- Hardness and approximation of submodular minimum linear ordering problems
- Embedding Wheel - like Networks
- The profile of the Cartesian product of graphs
- An optimal time algorithm for minimum linear arrangement of chord graphs
- Bothway embedding of circulant network into grid
- Communication tree problems
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- A result on the strength of graphs by factorizations of complete graphs
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Embedding of hypercubes into necklace, windmill and snake graphs
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- Wirelength of hypercubes into certain trees
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Multiscale approach for the network compression-friendly ordering
- SDP relaxations for some combinatorial optimization problems
- An extremal graph with given bandwidth
- Bandwidth of trees of diameter at most 4
- An integer programming model for the minimum interval graph completion problem
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Characterization of the congestion lemma on layout computation
- A correction on Shiloach's algorithm for minimum linear arrangement of trees
- The graph-bin packing problem
- Bandwidth of the strong product of two connected graphs
- Lower bounds for the bandwidth problem
- Edge Addition Number of Cartesian Product of Paths and Cycles
- Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
- Embeddings of circulant networks
- Linear layout of directed grid graph
- Compact representation of graphs with bounded bandwidth or treedepth
- Optimal embedding of locally twisted cubes into grids
- New classes of extremal graphs with given bandwidth
- Exact wirelength of hypercubes on a grid
- Tractabilities and intractabilities on geometric intersection graphs
- Bandwidth of the product of paths of the same length
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices
- Layout of embedding locally twisted cube into the extended theta mesh topology
- Random Generation and Enumeration of Proper Interval Graphs
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Profile minimization on compositions of graphs
- Degree bounds for linear discrepancy of interval orders and disconnected posets
- A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem
- A linear time algorithm for embedding hypercube into cylinder and torus
- Embedding of hypercubes into sibling trees
- Bandwidth of the corona of two graphs
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees
- Node set optimization problem for complete Josephus cubes
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
- Two models of two-dimensional bandwidth problems
- Bandwidth of the composition of two graphs.
- Profile minimization on products of graphs
- On the edge-bandwidth of graph products
- On semidefinite programming bounds for graph bandwidth
- On the profile of the corona of two graphs
- Reducing the bandwidth of a sparse matrix with a genetic algorithm
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- Minimum degree conditions for the strength and bandwidth of graphs
This page was built for publication: A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4248532)
