Back to Results
First PageMeta Content
Mathematics / Applied mathematics / Network flow / Flow network / Operations research


Deterministic Parameterized Algorithms for the Graph Motif ProblemI Ron Y. Pinter, Hadas Shachnai, Meirav Zehavi∗ Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel
Add to Reading List

Document Date: 2014-07-31 09:43:07


Open Document

File Size: 520,12 KB

Share Result on Facebook

City

Haifa / /

Company

Correctness / /

/

Facility

Israel Institute of Technology / /

IndustryTerm

deterministic algorithm / faster algorithms / deterministic parameterized algorithm / social networks / randomized algorithms / deterministic parameterized algorithms / computing / possible solutions / partial solutions / biological networks / randomized algorithm / partial solution / inefficient algorithms / /

Organization

Meirav Zehavi∗ Department of Computer Science / Israel Institute of Technology / Technion / /

Person

Graph Motif / Ron Y. Pinter / /

/

Position

Colonel / representative / General / Corresponding author / /

ProgrammingLanguage

R / /

Technology

deterministic algorithm / Deterministic Parameterized Algorithms / Techniques Our algorithms / deterministic parameterized algorithm / time algorithm / 6 Algorithm / /

SocialTag