@inproceedings{50f43629331648469ccd519147056788,

title = "Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid",

abstract = "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.",

author = "Steven Chaplick and Elad Cohen and Juraj Stacho",

note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",

year = "2011",

doi = "10.1007/978-3-642-25870-1_29",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer Nature Switzerland AG",

pages = "319--330",

editor = "P. Kolman and J. Kratochvil",

booktitle = "Graph-Theoretic Concepts in Computer Science. WG 2011",

}