Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.
Emilio Di GiacomoGiuseppe LiottaFrancesco TrottaPublished in: Graph Drawing (2007)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- minimum weight
- approximation algorithms
- spanning tree
- labeled graphs
- strongly connected
- graph structure
- directed acyclic graph
- graph drawing
- hamiltonian cycle
- bipartite graph
- graph matching
- attributed graphs
- minimum cost
- complex networks
- minimum spanning trees
- connected components
- random graphs
- maximum cardinality
- average degree
- edge detection
- adjacency graph
- minimum spanning tree
- graph model
- graph theory
- edge detector
- data sets
- series parallel
- position information
- graph structures
- graph data
- graph theoretic
- graph representation
- shortest path