Back to Results
First PageMeta Content
Complexity classes / NP-complete problems / Parameterized complexity / Tree decomposition / Dynamic programming / NP-hard / NP / Clique problem / Theoretical computer science / Computational complexity theory / Graph theory


Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract
Add to Reading List

Document Date: 2014-03-05 14:37:49


Open Document

File Size: 888,02 KB

Share Result on Facebook

Company

Potential Solutions / Potential Solution / /

Currency

pence / USD / /

/

IndustryTerm

incorrect solutions / parameterized algorithm / r−solution / then call algorithm / incorrect solution / correct solutions / r-solution / gives algorithm / present known parameterized algorithms / time exact algorithm / correct solution / r-solutions / Biological networks / searched solution / then calls algorithm / /

Organization

Meirav Zehavi Department of Computer Science / Technion / /

Person

Meirav Zehavi / Hadas Shachnai / Min Connected / Ron Y. Pinter / /

ProgrammingLanguage

V / /

Technology

PINQ algorithm / 3 present known parameterized algorithms / main algorithm / then call algorithm / then calls algorithm / 4 gives algorithm / dom / P. Our algorithms / /

SocialTag