Discrete trace theorems and energy minimizing spring embeddings of planar graphs
DOI10.1016/j.laa.2020.08.035zbMath1458.05158arXiv2001.10928OpenAlexW3083248785MaRDI QIDQ2226448
John C. Urschel, Ludmil T. Zikatanov
Publication date: 12 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.10928
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Caratterizzazioni delle tracce sulla frontiera relative ad alcune classi di funzioni in \(n\) variabili
- Drawing graphs by eigenvectors: theory and practice
- What are Schur complements, anyway?
- A linear algorithm for embedding planar graphs using PQ-trees
- Remarks on the Schur complement
- The Schur complement and its applications
- The university of Florida sparse matrix collection
- On Spectral Graph Drawing
- Direct Methods in the Theory of Elliptic Equations
- Boundary Integral Operators on Lipschitz Domains: Elementary Results
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- On the approximation of Laplacian eigenvalues in graph disaggregation
- How to Draw a Graph
This page was built for publication: Discrete trace theorems and energy minimizing spring embeddings of planar graphs