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

Fichtenberger, Hendrik ; Levi, Reut ; Vasudev, Yadu ; Wötzel, Maximilian

A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error

pdf-format:
LIPIcs-ICALP-2018-52.pdf (0.5 MB)

Abstract

We consider one-sided error property testing of F-minor freeness in bounded-degree graphs for any finite family of graphs F that contains a minor of K_{2,k}, the k-circus graph, or the (k x 2)-grid for any k in N. This includes, for instance, testing whether a graph is outerplanar or a cactus graph. The query complexity of our algorithm in terms of the number of vertices in the graph, n, is O~(n^{2/3} / epsilon^5). Czumaj et al. (2014) showed that cycle-freeness and C_k-minor freeness can be tested with query complexity O~(sqrt{n}) by using random walks, and that testing H-minor freeness for any H that contains a cycles requires Omega(sqrt{n}) queries. In contrast to these results, we analyze the structure of the graph and show that either we can find a subgraph of sublinear size that includes the forbidden minor H, or we can find a pair of disjoint subsets of vertices whose edge-cut is large, which induces an H-minor.

BibTeX - Entry

@InProceedings{fichtenberger_et_al:LIPIcs:2018:9056,
  author =	{Hendrik Fichtenberger and Reut Levi and Yadu Vasudev and Maximilian W{\"o}tzel},
  title =	{{A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error}},
  booktitle =	{45th International Colloquium on Automata, Languages, and  Programming (ICALP 2018)},
  pages =	{52:1--52:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-076-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{107},
  editor =	{Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9056},
  URN =		{urn:nbn:de:0030-drops-90563},
  doi =		{10.4230/LIPIcs.ICALP.2018.52},
  annote =	{Keywords: graph property testing, minor-free graphs}
}

Keywords: graph property testing, minor-free graphs
Collection: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Issue Date: 2018
Date of publication: 04.07.2018

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