Login / Signup
Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality.
Takanori Yamamoto
Hideo Bannai
Masao Nagasaki
Satoru Miyano
Published in:
Discovery Science (2009)
Keyphrases
</>
maximum weight
betweenness centrality
bipartite graph
weighted graph
minimum weight
shortest path
independent set
complex networks
graph partitioning
partial order
greedy heuristic
np hard
social networks
connected components
graph model
similarity measure
greedy algorithm
graph theory
multiscale