License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2022.52
URN: urn:nbn:de:0030-drops-158620
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15862/
Go to the corresponding LIPIcs Volume Portal

Pilipczuk, Michał ; Sokołowski, Marek ; Zych-Pawlewicz, Anna

Compact Representation for Matrices of Bounded Twin-Width

pdf-format:
LIPIcs-STACS-2022-52.pdf (0.7 MB)

Abstract

For every fixed d ∈ ℕ, we design a data structure that represents a binary n × n matrix that is d-twin-ordered. The data structure occupies ?_d(n) bits, which is the least one could hope for, and can be queried for entries of the matrix in time ?_d(log log n) per query.

BibTeX - Entry

@InProceedings{pilipczuk_et_al:LIPIcs.STACS.2022.52,
  author =	{Pilipczuk, Micha{\l} and Soko{\l}owski, Marek and Zych-Pawlewicz, Anna},
  title =	{{Compact Representation for Matrices of Bounded Twin-Width}},
  booktitle =	{39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
  pages =	{52:1--52:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-222-8},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{219},
  editor =	{Berenbrink, Petra and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/15862},
  URN =		{urn:nbn:de:0030-drops-158620},
  doi =		{10.4230/LIPIcs.STACS.2022.52},
  annote =	{Keywords: twin-width, compact representation, adjacency oracle}
}

Keywords: twin-width, compact representation, adjacency oracle
Collection: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Issue Date: 2022
Date of publication: 09.03.2022

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI