Back to Results
First PageMeta Content
Robertson–Seymour theorem / Tree decomposition / Minor / Planar graph / Linkless embedding / Graph coloring / Graph structure theorem / Clique-sum / Graph theory / Graph operations / Path decomposition


On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada
Add to Reading List

Document Date: 2009-10-06 02:54:05

Open Document

File Size: 171,17 KB

Share Result on Facebook

Country

New Zealand / /

/

Facility

University P.O. Box / Computer Science University of Auckland Auckland / Computer Science University of Victoria Victoria / Computer Science University of Tennessee Knoxville / /

IndustryTerm

search spaces / search ordering / basic computational machinery / dynamic programming algorithm / decision algorithm / search order / computation algorithm / exhaustive search / search space / /

MusicGroup

B.C. / /

NaturalFeature

Mt t=1 / Mt. / /

Organization

Computer Science University of Auckland Auckland / Computer Science University of Victoria Victoria / Kevin Cattell Department / Computer Science University of Tennessee Knoxville / /

Person

Michael A. Langston / Michael R. Fellows / Jens Lagergren / Michael J. Dinneen / Ty / Kevin Cattell / Rodney G. Downey / Victoria Victoria / /

Technology

dynamic programming algorithm / An algorithm / finite state machine / decision algorithm / computation algorithm / /

SocialTag