Back to Results
First PageMeta Content
NP-complete problems / Parameterized complexity / Kernelization / Dominating set / Vertex cover / Path decomposition / Planar separator theorem / Clique problem / Graph coloring / Theoretical computer science / Graph theory / Mathematics


Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow
Add to Reading List

Document Date: 2009-10-05 20:16:31


Open Document

File Size: 121,41 KB

Share Result on Facebook

City

Boston / /

Company

SIAM Journal / 3SAT / IEEE Press / Vertex / /

Country

Australia / /

/

Event

Reorganization / Force Majeure / /

Facility

University Drive / Computer Science University of Newcastle / /

IndustryTerm

depth-first search / plain linear time algorithm / exponential time algorithm / dynamic programming algorithm / classification tool / /

OperatingSystem

XP / /

Organization

FPT Michael R. Fellows School of Electrical Engineering / University of Newcastle / /

Person

R. Downey / V / Rolf Niedermeier / Max Internal / Faisal Abu-Khazm / /

ProgrammingLanguage

TSP / /

PublishedMedium

SIAM Journal on Computing / Electronic Notes in Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

FPT algorithm / linear time FPT algorithm / improved FPT algorithm / FPT algorithms / plain linear time algorithm / faster FPT algorithm / Nemhauser-Trotter algorithm / exponential time algorithm / dynamic programming algorithm / Linear Time Algorithm / quadratic FPT algorithm / /

SocialTag