The Minimum Wiener Connector Problem Natali Ruchansky Computer Science Dept. Boston University, USA

Source URL: arxiv.org

A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and

Source URL: theory.cs.uni-bonn.de

• Computational complexity theory
• Graph theory
• Mathematics
• NP-complete problems
• Steiner tree problem
• Approximation algorithm
• APX
• Spanning tree
• Optimization problem
• Wiener connector
• Travelling salesman problem

Data Mining and Knowledge Discovery manuscript No. (will be inserted by the editor) Fast approximation of betweenness centrality through sampling Matteo Riondato ·

Source URL: matteo.rionda.to

• Network theory
• Graph theory
• Centrality
• Betweenness centrality
• Distance
• Shortest path problem
• Connected component
• GirvanNewman algorithm
• Wiener connector