Login / Signup
Parameterized computational complexity of finding small-diameter subgraphs.
Alexander Schäfer
Christian Komusiewicz
Hannes Moser
Rolf Niedermeier
Published in:
Optim. Lett. (2012)
Keyphrases
</>
computational complexity
np complete
data structure
computationally efficient
data sets
small number
computational efficiency
machine learning
genetic algorithm
artificial intelligence
knowledge base
special case
np hard
rate distortion
low complexity