Login / Signup
Kernelization hardness of connectivity problems in d-degenerate graphs.
Marek Cygan
Marcin Pilipczuk
Michal Pilipczuk
Jakub Onufry Wojtaszczyk
Published in:
Discret. Appl. Math. (2012)
Keyphrases
</>
np complete
computational complexity
application domains
data mining
genetic algorithm
optimization problems
directed graph
learning theory
graph theory
solving problems