![NP-complete problems / Parameterized complexity / Kernelization / Path decomposition / Vertex cover / Feedback vertex set / Dominating set / Tree decomposition / Clique / Graph theory / Theoretical computer science / Mathematics NP-complete problems / Parameterized complexity / Kernelization / Path decomposition / Vertex cover / Feedback vertex set / Dominating set / Tree decomposition / Clique / Graph theory / Theoretical computer science / Mathematics](https://www.pdfsearch.io/img/005857b39d182df6b8e2062e9cd141e7.jpg)
| Document Date: 2012-08-07 06:26:48 Open Document File Size: 291,33 KBShare Result on Facebook
Company SIAM Journal / Vertex / / / Facility Club Input / / IndustryTerm fixed-parameter algorithm / typical social network / fixed-parameter algorithms / kernelization algorithms / biological networks / linear-time algorithms / linear-time algorithm / dynamic programming algorithm / social networks / graph algorithms / probabilistic networks / size-k solution / / OperatingSystem XP / / Organization Rolf Niedermeier Institut f¨ / Computational Intelligence / / Person J. Chen / Y. Cao / G. Xia / Rolf Niedermeier / J. Meng / Y. Liu / Manuel Sorge / I. A. Kanj / Mathias Weller / / Position co-author / Cao / / ProgrammingLanguage XML / / PublishedMedium SIAM Journal on Computing / Theoretical Computer Science / Lecture Notes in Computer Science / / Technology graph algorithms / fixed-parameter algorithms / fixed-parameter algorithm / practically relevant fixed-parameter algorithms / linear-time algorithms / time algorithm / dynamic programming algorithm / linear-time algorithm / kernelization algorithms / / URL http /
SocialTag |