Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 - Clique cover - Document - PDFSEARCH.IO

First Page	Meta Content
	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Document Date: 2012-09-21 09:31:02 Open Document File Size: 416,29 KB Share Result on Facebook City Ein-Gedi / Paris / / Company Vertex / AiG / / Country Germany / France / Israel / / / IndustryTerm fixed-parameter algorithm / distributed computing / fixed-parameter algorithms / polynomial-time algorithms / sparse social networks / social networks / n-time algorithm / extent efficient algorithms / social network / instance networks / / Organization Institut f¨ / / Person Ai / / Product Morgan Chopin1 / / Region Mediterranean / / Technology fixed-parameter algorithms / fixed-parameter algorithm / n-time algorithm / cvd / polynomial-time algorithms / / SocialTag Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory

Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1Add to Reading List