Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity

Hans L. Bodlaender, Hirotaka Ono, Yota Otachi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The problem MAX W-LIGHT (MAX W-HEAVY) for an undirected graph is to assign a direction to each edge so that the number of vertices of outdegree at most W (resp. at least W) is maximized. It is known that these problems are NP-hard even for fixed W. For example, Max 0-LIGHT is equivalent to the problem of finding a maximum independent set. In this paper, we show that for any fixed constant W, MAX W-HEAVY can be solved in linear time for hereditary graph classes for which treewidth is bounded by a function of degeneracy. We show that such graph classes include chordal graphs, circular-arc graphs, d-trapezoid graphs, chordal bipartite graphs, and graphs of bounded clique-width. To have a polynomial-time algorithm for MAX W-LIGHT, we need an additional condition of a polynomial upper bound on the number of potential maximal cliques to apply the metatheorem by Fomin, Todinca, and Villanger [SIAM J. Comput., 44(1):57-87, 2015]. The aforementioned graph classes, except bounded clique-width graphs, satisfy such a condition. For graphs of bounded clique-width, we present a dynamic programming approach not using the metatheorem to show that it is actually polynomial-time solvable for this graph class too. We also study the parameterized complexity of the problems and show some tractability and intractability results.

Original languageEnglish
Title of host publication27th International Symposium on Algorithms and Computation, ISAAC 2016
EditorsSeok-Hee Hong
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages20.1-20.12
ISBN (Electronic)9783959770262
DOIs
Publication statusPublished - Dec 1 2016
Event27th International Symposium on Algorithms and Computation, ISAAC 2016 - Sydney, Australia
Duration: Dec 12 2016Dec 14 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume64
ISSN (Print)1868-8969

Other

Other27th International Symposium on Algorithms and Computation, ISAAC 2016
CountryAustralia
CitySydney
Period12/12/1612/14/16

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity'. Together they form a unique fingerprint.

Cite this