Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
From MaRDI portal
Publication:1725794
DOI10.1007/978-3-030-04414-5_42OpenAlexW2888789435MaRDI QIDQ1725794
Dieter Mitsche, Dolores Lara, Carlos Hidalgo-Toscano, Clemens Huemer, Ruy Fabila-Monroy
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1808.09024
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Drawing graphs by eigenvectors: theory and practice
- Spectral partitioning works: planar graphs and finite element meshes
- Old and new results on algebraic connectivity of graphs
- Optimal linear labelings and eigenvalues of graphs
- Optimal labelling of a product of two paths
- Spectral bisection with two eigenvectors
- Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
- Spectral Clustering and Biclustering
- Voronoi Diagrams and Delaunay Triangulations
- The bandwidth problem for graphs and matrices—a survey
- Laplace eigenvalues and bandwidth‐type invariants of graphs
- Sums of Squares of Distances in m-Space
- Centroidal Voronoi Tessellations: Applications and Algorithms
This page was built for publication: Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity
