License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.SOSA.2018.14
URN: urn:nbn:de:0030-drops-82959
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8295/
Go to the corresponding OASIcs Volume Portal

McGregor, Andrew ; Vorotnikova, Sofya

A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs

pdf-format:
OASIcs-SOSA-2018-14.pdf (0.4 MB)

Abstract

We present a simple single-pass data stream algorithm using O((log n)/eps^2) space that returns an (alpha + 2)(1 + eps) approximation to the size of the maximum matching in a graph of arboricity alpha.

BibTeX - Entry

@InProceedings{mcgregor_et_al:OASIcs:2018:8295,
  author =	{Andrew McGregor and Sofya Vorotnikova},
  title =	{{A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs}},
  booktitle =	{1st Symposium on Simplicity in Algorithms (SOSA 2018)},
  pages =	{14:1--14:4},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-064-4},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{61},
  editor =	{Raimund Seidel},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8295},
  URN =		{urn:nbn:de:0030-drops-82959},
  doi =		{10.4230/OASIcs.SOSA.2018.14},
  annote =	{Keywords: data streams, matching, planar graphs, arboricity}
}

Keywords: data streams, matching, planar graphs, arboricity
Collection: 1st Symposium on Simplicity in Algorithms (SOSA 2018)
Issue Date: 2018
Date of publication: 05.01.2018

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