The rank-width of the square grid

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5344 LNCS, Issue , 2008, Pages 230-239

  Jelínek, Vít ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Grid graph; Rank width

Indexed keywords

COMPUTERS; TECHNICAL PRESENTATIONS;

GRID GRAPH; OF GRAPHS; OPEN PROBLEMS; RANK-WIDTH; SQUARE GRIDS; VERTEX SETS; WIDTH PARAMETERS;

COMPUTATIONAL GEOMETRY;

EID: 58349104029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_21     Document Type: Conference Paper

References (6)

1. Hliněný, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Computer Journal (advance access) (2007)
2. Oum, S.: Graphs of Bounded Rank-Width. PhD thesis, Princeton University (2005)
3. Oum. S.: Introduction to rank-width. In: Third workshop on graph classes, optimization, and width parameters. Eugene (2007), http://math.kaist.ac.kr/ ~sangil/pdf/2007eugene.pdf
4. Oum, S.: Recognizing rank-width. In: Oberwolfach Workshop "Graph Theory", http://math.kaist.ac.kr/~sangil/pdf/oberwolfach2005.pdf
5. Oum, S.: Rank-width is less than or equal to branch-width. Journal of Graph Theory 57(3), 239-244 (2007)
6. Oum. S., Seymour, P.: Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B 96(4). 514-528 (2006)