Grid drawings of graphs with constant edge-vertex resolution.
Michael A. BekosMartin GronemannFabrizio MontecchianiDömötör PálvölgyiAntonios SymvonisLeonidas TheocharousPublished in: Comput. Geom. (2021)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- labeled graphs
- minimum weight
- random graphs
- approximation algorithms
- high resolution
- attributed graphs
- strongly connected
- spanning tree
- directed acyclic graph
- bipartite graph
- hamiltonian cycle
- graph structure
- line drawings
- connected components
- graph partitioning
- complex networks
- shortest path
- low resolution
- edge detection
- minimum cost
- grid computing
- graph matching
- grid enabled
- np hard
- minimum spanning trees
- multiscale
- adjacency graph
- engineering drawings
- grid points
- graph databases
- edge detector
- social network analysis
- betweenness centrality
- social networks
- symbol recognition
- connected subgraphs