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.ISAAC.2018.19
URN: urn:nbn:de:0030-drops-99670
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9967/
Go to the corresponding LIPIcs Volume Portal

Björklund, Andreas ; Husfeldt, Thore

Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm

pdf-format:
LIPIcs-ISAAC-2018-19.pdf (0.4 MB)

Abstract

Given an undirected graph and two disjoint vertex pairs s_1,t_1 and s_2,t_2, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting s_1 with t_1, and s_2 with t_2, respectively.
We show that for cubic planar graphs there are NC algorithms, uniform circuits of polynomial size and polylogarithmic depth, that compute the S2DP and moreover also output the number of such minimum length path pairs.
Previously, to the best of our knowledge, no deterministic polynomial time algorithm was known for S2DP in cubic planar graphs with arbitrary placement of the terminals. In contrast, the randomized polynomial time algorithm by Björklund and Husfeldt, ICALP 2014, for general graphs is much slower, is serial in nature, and cannot count the solutions.
Our results are built on an approach by Hirai and Namba, Algorithmica 2017, for a generalisation of S2DP, and fast algorithms for counting perfect matchings in planar graphs.

BibTeX - Entry

@InProceedings{bjrklund_et_al:LIPIcs:2018:9967,
  author =	{Andreas Bj{\"o}rklund and Thore Husfeldt},
  title =	{{Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm}},
  booktitle =	{29th International Symposium on Algorithms and Computation  (ISAAC 2018)},
  pages =	{19:1--19:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-094-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{123},
  editor =	{Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9967},
  URN =		{urn:nbn:de:0030-drops-99670},
  doi =		{10.4230/LIPIcs.ISAAC.2018.19},
  annote =	{Keywords: Shortest disjoint paths, Cubic planar graph}
}

Keywords: Shortest disjoint paths, Cubic planar graph
Collection: 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Issue Date: 2018
Date of publication: 06.12.2018

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