We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as b 0-vpg graphs. Recognizing these graphs is an np-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal b 0-vpg graphs, and for recognizing b 0-vpg graphs that have a representation on a grid with 2 rows.
|Title of host publication||Graph-Theoretic Concepts in Computer Science. WG 2011|
|Editors||P. Kolman, J. Kratochvil|
|Publication status||Published - 2011|
|Series||Lecture Notes in Computer Science|