Pages that link to "Item:Q5603742"

The following pages link to An <i>r</i>-Dimensional Quadratic Placement Algorithm (Q5603742):

Displaying 37 items.

• A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification (Q448318) (← links)
• A regularized graph layout framework for dynamic network visualization (Q468664) (← links)
• Graph spectra in computer science (Q627958) (← links)
• A spectral characterization of the Delaunay triangulation (Q631026) (← links)
• Metric uniformization and spectral bounds for graphs (Q659931) (← links)
• Spectral methods for graph clustering - a survey (Q713095) (← links)
• Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
• Complex systems: features, similarity and connectivity (Q823211) (← links)
• Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
• Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
• A new lower bound for the single row facility layout problem (Q1003774) (← links)
• Normative location theory: Placement in continuous space (Q1237028) (← links)
• Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
• A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
• Variational perspective on local graph clustering (Q1739051) (← links)
• A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
• An ant algorithm for the single row layout problem in flexible manufacturing systems (Q1886861) (← links)
• Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
• Optimality of spectral clustering in the Gaussian mixture model (Q2054516) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Partitions of networks that are robust to vertex permutation dynamics (Q2344230) (← links)
• On the exact solution of a facility layout problem (Q2496073) (← links)
• One-dimensional layout optimization, with applications to graph drawing by axis separation (Q2573337) (← links)
• RingIt (Q2799494) (← links)
• Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
• Discrepancy and eigenvalues of Cayley graphs (Q2828826) (← links)
• A Sparse Stress Model (Q2961500) (← links)
• Exact Solution for the Optimal Neuronal Layout Problem (Q3160476) (← links)
• Graphs, Vectors, and Matrices (Q3178747) (← links)
• SPECTRAL METHODS CLUSTER WORDS OF THE SAME CLASS IN A SYNTACTIC DEPENDENCY NETWORK (Q3511054) (← links)
• The Binary Stress Model for Graph Drawing (Q3611852) (← links)
• Heuristische Verfahren zur Lösung quadratischer Zuordnungsprobleme (Q4071009) (← links)
• Equilateral Spherical Drawings of Planar Cayley Graphs (Q5144883) (← links)
• Coordinate Difference Matrices (Q5222098) (← links)
• Coherent structure colouring: identification of coherent structures from sparse data using graph theory (Q5360660) (← links)
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance (Q5883297) (← links)