Back to Results
First PageMeta Content
Path decomposition / Minor / Tree / Edge contraction / Forbidden graph characterization / Graph / Neighbourhood / Planar graph / Connectivity / Graph theory / Graph operations / Robertson–Seymour theorem


Journal of Universal Computer Science, vol. 3, no), submitted: 8/8/97, accepted: , appeared:  Springer Pub. Co. A Note on the Computability of Graph Minor Obstruction Sets for Mona
Add to Reading List

Document Date: 2009-10-14 09:38:23

Open Document

File Size: 160,48 KB

Share Result on Facebook

City

Ames / /

Company

IEEE Press / ACM Press / Ed. Cambridge University Press / /

/

Facility

Victoria University / Springer Pub / University of Victoria / University of Oregon / /

IndustryTerm

polynomial-time algorithms / decision algorithm / /

Organization

Cambridge University / Department of Mathematics / Victoria University / Wellington / Univ. of Iowa / University of Oregon / University of Victoria / Victoria / Humbold Univ. / American Mathematical Society / Department of Computer Science / Computer Science Department / /

Person

K. Cattell / B. Khoussainov / Rodney G. Downey / Bruno Courcelle / M.J. Dinneen / C.S. Calude / D.S. Bridges / Michael R. Fellows / /

ProvinceOrState

Oregon / Iowa / /

PublishedMedium

Theoretical Computer Science / the Theory of Computing / Lecture Notes in Computer Science / /

Technology

decision algorithm / polynomial-time algorithms / /

SocialTag