Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory

d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowski and Rotics [6] which states that problems expressible in MSO1 are solvable in linear time for graphs of bounded rankwidth. Our proof uses a game-theoretic approach and has the advantage of being selfcontained. In particular, our presentation does not assume any background in logic or automata theory. Moreover our approach can be generalized to prove other results of a similar flavor, for example, that of Courcelle’s Theorem for treewidth [3, 19].

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Alexander Langer, Peter Rossmanith, Somnath Sikdar
• Keywords: Alexander Langer, CORR 2011, Education, Game-theoretic Approach, RWTH Aachen University