Back to Results
First PageMeta Content
NP-complete problems / Cograph / Tree decomposition / Clique / Graph / Tree / Minor / Cycle rank / Path decomposition / Graph theory / Graph operations / Graph coloring


When Trees Grow Low: Shrubs and Fast MSO1 Robert Ganian1 , Petr Hlinˇen´ y2 , Jaroslav Neˇsetˇril3 , Jan Obdrˇz´alek2 , Patrice Ossona de Mendez4 , and Reshma Ramadurai2 1
Add to Reading List

Document Date: 2012-06-17 02:27:41

Open Document

File Size: 442,09 KB

Share Result on Facebook

Currency

pence / /

/

Facility

Charles University / Goethe University / Masaryk University / /

IndustryTerm

model checking algorithm / well known algorithms / polynomial time algorithm / /

MusicGroup

U2 / /

Organization

Institute for Informatics / Masaryk University / Charles University / Goethe University / Frankfurt / Faculty of Informatics / Institute for Theoretical Computer Science / /

Person

Petr Hlin / Jan Obdr / Jaroslav Ne / /

PublishedMedium

Theoretical Computer Science / /

Technology

FPT algorithm / well known algorithms / polynomial time algorithm / faster MSO1 model checking algorithm / MSO1 model checking algorithm / model checking algorithm / /

SocialTag