On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width

Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rank-decomposition of a graph (on contrary to the us...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 158; no. 7; pp. 851 - 867
Main Authors:	Ganian, Robert, Hliněný, Petr
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 06.04.2010
Subjects:	Graph colouring Myhill–Nerode theorem Parameterized algorithm Rank-width Myhill–Nerode theorem Graph colouring Parameterized algorithm Rank-width
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!