Finding large k-clubs in undirected graphs.

Maw-Shang Chang Ling-Ju Hung Chih-Ren Lin Ping-Chen Su

Published in: Computing (2013)

Keyphrases

undirected graph
strongly connected
approximation algorithms
directed graph
directed acyclic graph
connected components
minimum cost
disjoint paths
dynamic programming
random walk
complex networks
markov models