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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 64; no. 1; pp. 19 - 37
Main Author:	Lampis, Michael
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.09.2012
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!