Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.
Emilio Di GiacomoGiuseppe LiottaFrancesco TrottaPublished in: Algorithmica (2010)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- minimum weight
- minimum cost
- connected components
- approximation algorithms
- graph drawing
- directed acyclic graph
- complex networks
- attributed graphs
- bipartite graph
- spanning tree
- edge detection
- strongly connected
- graph structure
- labeled graphs
- random graphs
- maximum cardinality
- minimum spanning trees
- connected subgraphs
- graph partitioning
- subgraph isomorphism
- hamiltonian cycle
- pairwise
- minimum spanning tree
- graph matching
- color regions
- shortest path
- random walk
- np hard