Login / Signup
Neighborhood complexity and kernelization for nowhere dense classes of graphs.
Kord Eickmeyer
Archontia C. Giannopoulou
Stephan Kreutzer
O-joung Kwon
Michal Pilipczuk
Roman Rabinovich
Sebastian Siebertz
Published in:
CoRR (2016)
Keyphrases
</>
tractable cases
computational complexity
complexity measures
space complexity
lower bound
worst case
weighted graph
neighborhood information
training data
graph representation
graph theoretic
graph clustering
neighborhood graph
graph structures
intrinsic complexity
quasi cliques