Back to Results
First PageMeta Content
NP-complete problems / Topological graph theory / Apex graph / Planar separator theorem / Minor / Tree decomposition / Dual graph / Matching / Planarity testing / Graph theory / Planar graphs / Graph operations


Document Date: 2010-06-29 01:29:34

Open Document

File Size: 200,32 KB

Share Result on Facebook

City

Seattle / Cambridge / Providence / London / Baltimore / /

Company

International Journal / BOUNDED TREE - WIDTH Let us / Johns Hopkins University Press / VERTEX / Chiyoda / /

Currency

pence / /

/

Facility

Ken-ichi Kawarabayashi National Institute of Informatics / /

IndustryTerm

linear time algorithms / polynomial time algorithms / seminal algorithm / approximation algorithm / brute force algorithm / linear time algorithm / nontrivial linear time algorithms / planarity algorithm / linear-time algorithm / simpler linear time algorithm / computing / above mentioned linear time algorithms / graph algorithms / approximation algorithms / /

Organization

African Union / V (AP ) / Cambridge Univ. / Johns Hopkins University / F. Let / Ken-ichi Kawarabayashi National Institute of Informatics / /

Person

Ai / /

/

Position

Traveling Salesman / /

ProgrammingLanguage

TSP / /

ProvinceOrState

Rhode Island / Maryland / Washington / /

PublishedMedium

Theory of Computing / Lecture Notes in Computer Science / /

Technology

graph algorithms / above mentioned linear time algorithms / simpler linear time algorithm / main algorithm / nontrivial linear time algorithms / planarity algorithm / 0 planarity algorithm / seminal algorithm / linear time algorithms / approximation algorithm / brute force algorithm / time algorithm / approximation algorithms / linear time algorithm / polynomial time algorithms / linear-time algorithm / /

URL

http /

SocialTag