Back to Results
First PageMeta Content
NP-complete problems / Combinatorial optimization / Dynamic programming / Mathematical optimization / Operations research / Optimal control / Connectivity / Tree decomposition / Parameterized complexity / Theoretical computer science / Graph theory / Mathematics


Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of
Add to Reading List

Document Date: 2014-03-05 14:35:59


Open Document

File Size: 539,83 KB

Share Result on Facebook

City

Haifa / /

Company

Vertex / Vf / /

Country

Israel / /

Currency

pence / /

/

IndustryTerm

parameterized algorithm / data mining / faster algorithms / faster algorithm / parallel computing / /

Organization

Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science / Technion / /

Person

Min / Max / /

Position

representative / /

Product

Pentax K-x Digital Camera / /

Technology

faster algorithm / data mining / time algorithms / 4.3 An Algorithm / 3.3 An Algorithm / parameterized algorithm / time algorithm / 2.3 An Algorithm / /

SocialTag