A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
From MaRDI portal
Publication:4248532
DOI<75::AID-JGT1>3.0.CO;2-S 10.1002/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-SzbMath0924.05058OpenAlexW4235419234MaRDI QIDQ4248532
Yung-Ling Lai, Kenneth L. Williams
Publication date: 10 November 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199906)31:2<75::aid-jgt1>3.0.co;2-s
Related Items
An integer programming model for the Minimum Interval Graph Completion Problem, A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees, The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete, A Result on the Strength of Graphs by Factorizations of Complete Graphs, On semidefinite programming bounds for graph bandwidth, Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees, Reducing the bandwidth of a sparse matrix with a genetic algorithm, Minimum degree conditions for the strength and bandwidth of graphs, Embeddings of circulant networks, Lower bounds for the bandwidth problem, An extremal graph with given bandwidth, Layout of embedding locally twisted cube into the extended theta mesh topology, Compact representation of graphs with bounded bandwidth or treedepth, THE GRAPH-BIN PACKING PROBLEM, Efficient iterated greedy for the two-dimensional bandwidth minimization problem, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, Minimum average congestion of enhanced and augmented hypercubes into complete binary trees, Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans, Minimum Linear Arrangement of Generalized Sierpinski Graphs, Bandwidth of the composition of two graphs., Embedding Wheel - like Networks, Bandwidth of trees of diameter at most 4, A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout, Embedding of hypercubes into necklace, windmill and snake graphs, Optimal Embedding of Locally Twisted Cubes into Grids, On the optimal layout of balanced complete multipartite graphs into grids and tree related structures, Bandwidth of the product of paths of the same length, Embedding of hypercubes into sibling trees, Two models of two-dimensional bandwidth problems, Bandwidth of the corona of two graphs, New classes of extremal graphs with given bandwidth, Tractabilities and intractabilities on geometric intersection graphs, Bothway embedding of circulant network into grid, An optimal time algorithm for minimum linear arrangement of chord graphs, Bandwidth of the strong product of two connected graphs, Profile minimization on compositions of graphs, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, Wirelength of hypercubes into certain trees, An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem, Multiscale approach for the network compression-friendly ordering, A linear time algorithm for embedding hypercube into cylinder and torus, Profile minimization on products of graphs, Degree bounds for linear discrepancy of interval orders and disconnected posets, Maximum incomplete recursive circulants in graph embeddings, On the edge-bandwidth of graph products, Node set optimization problem for complete Josephus cubes, Random Generation and Enumeration of Proper Interval Graphs, Communication tree problems, A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem, SDP Relaxations for Some Combinatorial Optimization Problems, Linear layout of directed grid graph, The profile of the Cartesian product of graphs, Characterization of the congestion lemma on layout computation, On explicit formulas for bandwidth and antibandwidth of hypercubes, Exact wirelength of hypercubes on a grid, On the profile of the corona of two graphs, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Embedding algorithm of spined cube into grid structure and its wirelength computation, Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees, Edge Addition Number of Cartesian Product of Paths and Cycles
Cites Work
