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.IPEC.2016.10
URN: urn:nbn:de:0030-drops-69353
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/6935/
Go to the corresponding LIPIcs Volume Portal

Bredereck, Robert ; Froese, Vincent ; Koseler, Marcel ; Millani, Marcelo Garlet ; Nichterlein, André ; Niedermeier, Rolf

A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs

pdf-format:
LIPIcs-IPEC-2016-10.pdf (0.5 MB)

Abstract

There has been intensive work on the parameterized complexity of the typically NP-hard task to edit undirected graphs into graphs fulfilling certain given vertex degree constraints. In this work, we lift the investigations to the case of directed graphs; herein, we focus on arc insertions. To this end, our general two-stage framework consists of efficiently solving a problem-specific number problem transferring its solution to a solution for the graph problem by applying flow computations. In this way, we obtain fixed-parameter tractability and polynomial kernelizability results, with the central parameter being the maximum vertex in- or outdegree of the output digraph. Although there are certain similarities with the much better studied undirected case, the flow computation used in the directed case seems not to work for the undirected case while f-factor computations as used in the undirected case seem not to work for the directed case.

BibTeX - Entry

@InProceedings{bredereck_et_al:LIPIcs:2017:6935,
  author =	{Robert Bredereck and Vincent Froese and Marcel Koseler and Marcelo Garlet Millani and Andr{\'e} Nichterlein and Rolf Niedermeier},
  title =	{{A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs}},
  booktitle =	{11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-023-1},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{63},
  editor =	{Jiong Guo and Danny Hermelin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/6935},
  URN =		{urn:nbn:de:0030-drops-69353},
  doi =		{10.4230/LIPIcs.IPEC.2016.10},
  annote =	{Keywords: NP-hard graph problem, graph realizability, graph modification, arc insertion, fixed-parameter tractability, kernelization}
}

Keywords: NP-hard graph problem, graph realizability, graph modification, arc insertion, fixed-parameter tractability, kernelization
Collection: 11th International Symposium on Parameterized and Exact Computation (IPEC 2016)
Issue Date: 2017
Date of publication: 09.02.2017

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