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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 64; H. 1; S. 19 - 37
1. Verfasser:	Lampis, Michael
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer-Verlag 01.09.2012
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!