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

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

2011-02-04

arxiv.org/abs/1102.0908v1

Computer Science

Data Structures and Algorithms

Submitted

Scientific paper

We present an alternative proof of a theorem by Courcelle, Makowski and Rotics which states that problems expressible in MSO are solvable in linear time for graphs of bounded rankwidth. Our proof uses a game-theoretic approach and has the advantage of being self-contained, intuitive, and fairly easy to follow. In particular, our presentation does not assume any background in logic or automata theory. We believe that it is good to have alternative proofs of this important result. Moreover our approach can be generalized to prove other results of a similar flavor, for example, that of Courcelle's Theorem for treewidth.

Affiliated with

Also associated with

No associations

Rating

Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491776