Pages that link to "Item:Q1192949"

The following pages link to Optimal linear labelings and eigenvalues of graphs (Q1192949):

Displaying 36 items.

• Physical synthesis of quantum circuits using templates (Q332112) (← links)
• Branch and bound for the cutwidth minimization problem (Q339558) (← links)
• Semidefinite relaxations of ordering problems (Q359627) (← links)
• Heuristics for the data arrangement problem on regular trees (Q498454) (← links)
• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
• Multiscale approach for the network compression-friendly ordering (Q553960) (← links)
• On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs (Q556891) (← links)
• Continuation methods for approximate large scale object sequencing (Q669313) (← links)
• \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
• Laplace eigenvalues of graphs---a survey (Q686298) (← links)
• Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
• A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem (Q732777) (← links)
• Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
• Latent semantic analysis and Fiedler retrieval (Q869904) (← links)
• Old and new results on algebraic connectivity of graphs (Q876302) (← links)
• A computational study of graph partitioning (Q1340061) (← links)
• Two improved algorithms for envelope and wavefront reduction (Q1371664) (← links)
• On minimum cuts and the linear arrangement problem (Q1570828) (← links)
• A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
• New relationships for multi-neighborhood search for the minimum linear arrangement problem (Q1679609) (← links)
• Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity (Q1725794) (← links)
• Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
• Diffusion bank networks and capital flows (Q2230764) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Minimizing profile of graphs using a hybrid simulating annealing algorithm (Q2413387) (← links)
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem (Q2482382) (← links)
• One-dimensional layout optimization, with applications to graph drawing by axis separation (Q2573337) (← links)
• (Q2861498) (← links)
• Packing of (0, 1)-matrices (Q3423133) (← links)
• A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
• A survey of graph laplacians (Q4853923) (← links)
• A spectral approach to bandwidth and separator problems in graphs (Q4853927) (← links)
• Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path (Q5087084) (← links)
• On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← links)
• Experiments on the minimum linear arrangement problem (Q5463444) (← links)
• Combinatorial Fiedler theory and graph partition (Q6118786) (← links)