Optimal linear labelings and eigenvalues of graphs
From MaRDI portal
Publication:1192949
DOI10.1016/0166-218X(92)90229-4zbMath0759.05087MaRDI QIDQ1192949
Publication date: 27 September 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (36)
A computational study of graph partitioning ⋮ Physical synthesis of quantum circuits using templates ⋮ Branch and bound for the cutwidth minimization problem ⋮ Two improved algorithms for envelope and wavefront reduction ⋮ Lower bounds for the quadratic assignment problem via triangle decompositions ⋮ Semidefinite relaxations of ordering problems ⋮ Latent semantic analysis and Fiedler retrieval ⋮ Old and new results on algebraic connectivity of graphs ⋮ Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path ⋮ New relationships for multi-neighborhood search for the minimum linear arrangement problem ⋮ Minimizing profile of graphs using a hybrid simulating annealing algorithm ⋮ On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem ⋮ A survey of graph laplacians ⋮ A spectral approach to bandwidth and separator problems in graphs ⋮ A New Lower Bound for the Minimum Linear Arrangement of a Graph ⋮ Combinatorial Fiedler theory and graph partition ⋮ Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity ⋮ Diffusion bank networks and capital flows ⋮ Continuation methods for approximate large scale object sequencing ⋮ \texttt{PQser:} a Matlab package for spectral seriation ⋮ Heuristics for the data arrangement problem on regular trees ⋮ On Laplacian spectra of parametric families of closely connected networks with application to cooperative control ⋮ Laplace eigenvalues of graphs---a survey ⋮ Graceful labelling: state of the art, applications and future directions ⋮ An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem ⋮ Multiscale approach for the network compression-friendly ordering ⋮ Unnamed Item ⋮ On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs ⋮ A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem ⋮ Experiments on the minimum linear arrangement problem ⋮ On minimum cuts and the linear arrangement problem ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Packing of (0, 1)-matrices ⋮ One-dimensional layout optimization, with applications to graph drawing by axis separation ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem ⋮ Drawing graphs by eigenvectors: theory and practice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On optimal linear arrangements of trees
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Optimal labelling of a product of two paths
- The NP-completeness of the bandwidth minimization problem
- The bandwidth problem for graphs and matrices—a survey
- Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
- Complexity Results for Bandwidth Minimization
- Laplace eigenvalues and bandwidth‐type invariants of graphs
This page was built for publication: Optimal linear labelings and eigenvalues of graphs
