Shortest-path queries for complex networks: exploiting low tree-width outside the core.
Takuya AkibaChristian SommerKen-ichi KawarabayashiPublished in: EDBT (2012)
Keyphrases
- shortest path
- tree width
- complex networks
- path queries
- betweenness centrality
- spatial networks
- flow graph
- social networks
- tree decomposition
- graph theory
- community detection
- query processing
- social network analysis
- road network
- network analysis
- shortest path algorithm
- community structure
- network structure
- query language
- real world networks
- structural properties
- query evaluation
- data sources
- small world
- path length
- exact and approximate
- weighted graph
- information theoretic concepts
- biological networks
- constraint networks
- data management
- graphical models
- upper bound
- lower bound