Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs.

Jacob Evald Søren Dahlgaard

Published in: CoRR (2016)

Keyphrases

np complete
objective function
search algorithm
computational complexity
upper bound
genetic algorithm
social networks
lower bound
worst case
distance measure
application domains
decision problems
phase transition
bipartite graph