Login / Signup

Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs.

Kord EickmeyerArchontia C. GiannopoulouStephan KreutzerO-joung KwonMichal PilipczukRoman RabinovichSebastian Siebertz
Published in: ICALP (2017)
Keyphrases
  • tractable cases
  • neighborhood graph
  • complexity measures
  • data sets
  • decision problems
  • social networks
  • worst case
  • directed graph
  • graph matching
  • graph mining
  • graph theoretic
  • intrinsic complexity