Top-k Overlapping Densest Subgraphs: Approximation and Complexity.

Riccardo Dondi Mohammad Mehdi Hosseinzadeh Giancarlo Mauri Italo Zoppis

Published in: ICTCS (2019)

Keyphrases

decision problems
computational complexity
graph mining
approximation algorithms
error bounds
approximation error
query processing
computational cost
worst case
increase in computational complexity