License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2017.39
URN: urn:nbn:de:0030-drops-78798
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7879/
Go to the corresponding LIPIcs Volume Portal


Gajjar, Kshitij ; Radhakrishnan, Jaikumar

Distance-Preserving Subgraphs of Interval Graphs

pdf-format:
LIPIcs-ESA-2017-39.pdf (0.5 MB)


Abstract

We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs that have k terminal vertices. We show that every interval graph admits a distance-preserving subgraph with O(k log k) branching vertices. We also prove a matching lower bound by exhibiting an interval graph based on bit-reversal permutation matrices. In addition, we show that interval graphs admit subgraphs with O(k) branching vertices that approximate distances up to an additive term of +1.

BibTeX - Entry

@InProceedings{gajjar_et_al:LIPIcs:2017:7879,
  author =	{Kshitij Gajjar and Jaikumar Radhakrishnan},
  title =	{{Distance-Preserving Subgraphs of Interval Graphs}},
  booktitle =	{25th Annual European Symposium on Algorithms (ESA 2017)},
  pages =	{39:1--39:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-049-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{87},
  editor =	{Kirk Pruhs and Christian Sohler},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7879},
  URN =		{urn:nbn:de:0030-drops-78798},
  doi =		{10.4230/LIPIcs.ESA.2017.39},
  annote =	{Keywords: interval graphs, shortest path, distance-preserving subgraphs, bit-reversal permutation matrix}
}

Keywords: interval graphs, shortest path, distance-preserving subgraphs, bit-reversal permutation matrix
Seminar: 25th Annual European Symposium on Algorithms (ESA 2017)
Issue Date: 2017
Date of publication: 31.08.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI