Edge Routing and Bundling for Graphs with Fixed Node Positions.
Miroslav CermákJirí DokulilJana KatreniakováPublished in: IV (2011)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- directed graph
- shortest path
- graph structure
- disjoint paths
- finding the shortest path
- densely connected
- spanning tree
- vertex set
- random graphs
- minimum spanning trees
- routing protocol
- source node
- edge detection
- network nodes
- network topologies
- complex networks
- connected components
- routing algorithm
- node density
- strongly connected
- graph matching
- graph clustering
- packet transmission
- random walk
- destination node
- node selection
- approximation algorithms
- optimal path
- graph theory
- directed acyclic graph
- graph theoretic
- ad hoc networks
- graph partitioning
- bipartite graph
- intermediate nodes
- routing problem
- edge information
- tree structure
- graph mining
- graphical models
- wireless sensor networks
- network topology