Drawing graphs by eigenvectors: theory and practice
From MaRDI portal
Publication:814052
DOI10.1016/j.camwa.2004.08.015zbMath1080.05024OpenAlexW1971240015WikidataQ56226607 ScholiaQ56226607MaRDI QIDQ814052
Publication date: 2 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2004.08.015
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (max. 100)
Complex systems: features, similarity and connectivity ⋮ A graph theoretic framework for representation, exploration and analysis on computed states of physical systems ⋮ Understanding the message passing in graph neural networks via power iteration clustering ⋮ Graph spectra in computer science ⋮ Coherent structure colouring: identification of coherent structures from sparse data using graph theory ⋮ Capturing polytopal symmetries by coloring the edge-graph ⋮ A quality metric for visualization of clusters in graphs ⋮ Spectral clustering and the high-dimensional stochastic blockmodel ⋮ A regularized graph layout framework for dynamic network visualization ⋮ Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity ⋮ Discrete trace theorems and energy minimizing spring embeddings of planar graphs ⋮ Geometry and topology of symmetric point arrangements ⋮ Graph Similarity and Approximate Isomorphism ⋮ A new matrix representation of multidigraphs ⋮ Analysis of multiview legislative networks with structured matrix factorization: does Twitter influence translate to the real world?
Cites Work
- Optimal linear labelings and eigenvalues of graphs
- On Spectral Graph Drawing
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Homeomorphism of 2-Complexes is Graph Isomorphism Complete
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- An r-Dimensional Quadratic Placement Algorithm
- How to Draw a Graph
- Drawing graphs. Methods and models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Drawing graphs by eigenvectors: theory and practice
