On edge intersection graphs of paths with 2 bends
Pergel, M and Rzazewski, Pavel Michael (2016) On edge intersection graphs of paths with 2 bends. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 9941 L. pp. 207219. ISSN 03029743 10.1007/9783662535363_18

Text
Pergel_207_3173436_ny.pdf Download (224kB)  Preview 
Abstract
An EPGrepresentation of a graph G is a collection of paths in a grid, each corresponding to a single vertex of G, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPGrepresentations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, along with some subclasses. We also initiate the study of graphs representable by unaligned polylines, and by polylines, whose every segment is parallel to one of prescribed slopes. We show hardness of recognition and explore the tradeoff between the number of bends and the number of slopes. © SpringerVerlag GmbH Germany 2016.
Item Type:  Article 

Uncontrolled Keywords:  Graph theory; Trade off; Single vertex; Representation of a graph; Polylines; Intersection graph; hardness; Graphic methods; Economic and social effects 
Subjects:  Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány 
Divisions:  Informatics Laboratory 
SWORD Depositor:  MTMT Injector 
Depositing User:  MTMT Injector 
Date Deposited:  03 Feb 2017 08:50 
Last Modified:  21 Jul 2019 14:01 
URI:  http://eprints.sztaki.hu/id/eprint/9063 
Update Item 