Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10127532" target="_blank" >RIV/00216208:11320/12:10127532 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-34611-8_28" target="_blank" >http://dx.doi.org/10.1007/978-3-642-34611-8_28</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-34611-8_28" target="_blank" >10.1007/978-3-642-34611-8_28</a>

Result language
angličtina
Original language name
Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
Original language description
In this paper, we study properties of intersection graphs of k- bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by B(k)-VPG. We showhere that for every fixed k, B(k) -VPG is a strict subset of B(k+1) -VPG and that recognition of graphs from B(k) -VPG is NP-complete even when the input graph is given by a B(k+1)-VPG representation. We also show that the class B(k) -VPG (for k at least 1) is in no inclusion relation with the class of intersection graphs of straight line segments in the plane.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
<a href="/en/project/GEGIG%2F11%2FE023" target="_blank" >GEGIG/11/E023: Graph Drawings and Representations</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)