| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4949619 | Discrete Applied Mathematics | 2017 | 11 Pages |
Abstract
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 trade-off between the number of bends and the number of slopes.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Martin Pergel, PaweÅ RzÄ
żewski,