Login / Signup
Proportionally dense subgraph of maximum size: Complexity and approximation.
Cristina Bazgan
Janka Chlebíková
Clément Dallard
Thomas Pontoizeau
Published in:
Discret. Appl. Math. (2019)
Keyphrases
</>
computational complexity
space complexity
approximation error
maximum number
memory requirements
network size
closed form
data sets
query language
database
decision problems
graph mining
optimal solution
space requirements
social networks
subgraph isomorphism
polynomial size