Back to Results
First PageMeta Content
Planar graphs / Graph coloring / Line graph / Robertson–Seymour theorem / Graph theory / Minor / Graph operations


Nonconstructive Tools for Proving Polynomial-Time Decidability MICHAEL R.
Add to Reading List

Document Date: 2009-08-06 03:12:08


Open Document

File Size: 982,28 KB

Share Result on Facebook

Company

Pullman / /

Currency

USD / ECS / /

Facility

Washington State University / FELLOWS University of Idaho / State University / University of Idaho / /

IndustryTerm

produced polynomial-time algorithms / decision algorithms / polynomial-time algorithms / parallel computing / fundamental tool / large network / exponential algorithm / distributed computing / 141that efficient algorithms / complexity tool / aflirrnative solution / graph algorithms / polynomial-time decision algorithms / polynomial-time decision algorithm / /

Organization

National Science Foundation / Department of Computer Science / Washington State University / University of Idaho / Moscow / Association for Computing Machinery / /

Person

MICHAEL A. LANGSTON / Washington Abstract / /

Position

Graph Theory-graph algorithms General / /

ProvinceOrState

Kansas / Idaho / Washington / /

Technology

graph algorithms / decision algorithms / produced polynomial-time algorithms / existing polynomial-time algorithms / polynomial-time algorithms / polynomial-time decision algorithms / polynomial-time decision algorithm / Graph Theory-graph algorithms / /

SocialTag