Back to Results
First PageMeta Content
NP-complete problems / Graph operations / Tree decomposition / Minor / Parameterized complexity / Dominating set / Chordal graph / Equitable coloring / Clique / Graph theory / Theoretical computer science / Graph coloring


Not So Easy Problems For Tree Decomposable Graphs Stefan Szeider∗
Add to Reading List

Document Date: 2009-11-19 11:09:35

Open Document

File Size: 181,55 KB

Share Result on Facebook

City

Durham / /

Country

Australia / United Kingdom / /

/

Facility

Durham University / University of Wollongong / /

IndustryTerm

important algorithmic applications / polynomial-time algorithm / polynomial-time algorithms / /

Organization

Australian Computer Society / pp. / Department of Computer Science / University of Wollongong / Durham University / /

Person

Partitioned Clique / /

Position

vp vq / General / /

ProvinceOrState

New South Wales / Quebec / /

Region

South Wales / /

Technology

J. Algorithms / Information Technology / polynomial-time algorithms / polynomial-time algorithm / /

SocialTag