Current Flow Closeness Maximization
Code for paper https://arxiv.org/abs/1802.02556
Julia version 0.6.0
Julia package Laplacians.jl which can be installed by
julia -e 'Pkg.add("Laplacians.jl")'
How to run
OPENBLAS_NUM_THREADS=1 julia -O3 test.jl data-dir algos k, where
data-diris the directory where the edges list files are. The algorithms will run on these files in lexicographical order of the file names. The result will be printed to both console and file
algosdenotes which algorithms to run.
exactmeans running exact greedy,
approxmeans running approx greedy, and
bothmeans running both greedy algorithms (default
kis an integer, denotes the number of vertices to chose (default
OPENBLAS_NUM_THREADS=1is to enforce the program to run on a single thread.
OPENBLAS_NUM_THREADS=1 julia -O3 test.jl data exact 5
means running the exact greedy on networks in directory
choosing 5 vertices for each network. The result will be printed to
both console and