Back to Results
First PageMeta Content
Network theory / NP-complete problems / Tree decomposition / Metric dimension / Outerplanar graph / Shortest path problem / Line graph / Feedback vertex set / Graph / Graph theory / Graph operations / Planar graphs


Document Date: 2012-07-18 09:25:20

Open Document

File Size: 195,19 KB

Share Result on Facebook

City

Barcelona / /

Company

Vertex / /

Country

Italy / Spain / /

/

Facility

Sapienza University of Rome / /

IndustryTerm

bounded treewidth algorithms / polynomial-time algorithms / constant approximation algorithm / log n-approximation algorithm / greedy algorithm / polynomial-time algorithm / linear-time algorithm / dynamic programming algorithm / simpler algorithm / /

Organization

University of Rome / Finnish Cultural Foundation / /

Person

Bailey / Cameron / /

Position

representative / same representative / /

Technology

main algorithm / 3.3 Algorithm / bounded treewidth algorithms / 11 Algorithm / polynomial-time algorithms / polynomial-time algorithm / 12 Algorithm / greedy algorithm / known algorithm / simpler algorithm / dynamic programming algorithm / 2 log n-approximation algorithm / 3 Algorithm / constant approximation algorithm / log n-approximation algorithm / linear-time algorithm / /

SocialTag