Combinatorial Properties and Recognition of Unit Square Visibility Graphs

Katrin Casel, Henning Fernau, Alexander Grigoriev, Markus L. Schmid, Sue Whitesides

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axis-parallel visibility between unit squares placed (on integer grid coordinates) in the plane. We investigate combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i. e., the problem of representing USGV with fixed visibilities within small area and, for USV, the general recognition problem.
Original languageEnglish
Title of host publication42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
EditorsKim G. Larsen , Hans L. Bodlaender , Jean-Francois Raskin
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Pages30:1-30:15
Volume83
ISBN (Electronic)978-3-95977-046-0
DOIs
Publication statusPublished - Dec 2017
EventInternational Symposium on Mathematical Foundations of Computer Science - Aalborg University, Aalborg , Denmark
Duration: 21 Aug 201725 Aug 2017
Conference number: 42
http://mfcs2017.cs.aau.dk/

Publication series

SeriesLeibniz International Proceedings in Informatics (LIPIcs)
Volume83

Conference

ConferenceInternational Symposium on Mathematical Foundations of Computer Science
Abbreviated titleMFCS 2017
CountryDenmark
CityAalborg
Period21/08/1725/08/17
Internet address

JEL classifications

  • c00 - Mathematical and Quantitative Methods: General

Keywords

  • visibility graphs
  • exact algorithms
  • NP-completeness
  • visibility layout

Cite this