Algorithmic Meta-theorems for Restrictions of Treewidth

Possibly the most famous algorithmic meta-theorem is Courcelle’s theorem, which states that all MSO-expressible graph properties are decidable in linear time for graphs of bounded treewidth. Unfortunately, the running time’s dependence on the formula describing the problem is in general a tower of e...

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 64; číslo 1; s. 19 - 37
Hlavní autor:	Lampis, Michael
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.09.2012
Témata:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Courcelle's theorem Data Structures and Information Theory Mathematics of Computing Max-leaf number MSO logic Theory of Computation Vertex cover Vertex cover Max-leaf number MSO logic Courcelle’s theorem
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!