Area requirement of graph drawings with few crossings per edge.
Emilio Di GiacomoWalter DidimoGiuseppe LiottaFabrizio MontecchianiPublished in: Comput. Geom. (2013)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- disjoint paths
- graph structure
- vertex set
- graph model
- contour closure
- graph representation
- graph theory
- structured data
- directed graph
- bipartite graph
- shortest path
- strongly connected
- minimum spanning tree
- social network analysis
- graph partitioning
- complex networks
- graph theoretic
- spanning tree
- graph databases
- edge detector
- directed acyclic graph
- graph matching
- edge detection