A Maximum Linear Arrangement Problem on Directed Graphs

10/29/2018
by   Matt DeVos, et al.
0

We propose a new arrangement problem on directed graphs, Maximum Directed Linear Arrangement (MaxDLA). This is a directed variant of a similar problem for undirected graphs, in which however one seeks maximum and not minimum; this problem known as the Minimum Linear Arrangement Problem (MinLA) has been much studied in the literature. We establish a number of theorems illustrating the behavior and complexity of MaxDLA. First, we relate MaxDLA to Maximum Directed Cut (MaxDiCut) by proving that every simple digraph D on n vertices satisfies n/2maxDiCut(D) ≤ MaxDLA(D) ≤ (n-1)MaxDiCut(D). Next, we prove that MaxDiCut is NP-Hard for planar digraphs (even with the added restriction of maximum degree 15); it follows from the above bounds that MaxDLA is also NP-Hard for planar digraphs. In contrast, Hadlock (1975) and Dorfman and Orlova (1972) showed that the undirected Maximum Cut problem is solvable in polynomial time on planar graphs. On the positive side, we present a polynomial-time algorithm for solving MaxDLA on orientations of trees with degree bounded by a constant, which translates to a polynomial-time algorithm for solving MinLA on the complements of those trees. This pairs with results by Goldberg and Klipker (1976), Shiloach (1979) and Chung (1984) solving MinLA in polynomial time on trees. Finally, analogues of Harper's famous isoperimetric inequality for the hypercube, in the setting of MaxDLA, are shown for tournaments, orientations of graphs with degree at most two, and transitive acyclic digraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2020

Polynomial Time Algorithms for Tracking Path Problems

Given a graph G, and terminal vertices s and t, the TRACKING PATHS probl...
research
06/23/2021

Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint Programming

Bayesian networks are probabilistic graphical models with a wide range o...
research
07/07/2021

Reconfiguring Directed Trees in a Digraph

In this paper, we investigate the computational complexity of subgraph r...
research
06/22/2020

A polynomial-time algorithm for learning nonparametric causal graphs

We establish finite-sample guarantees for a polynomial-time algorithm fo...
research
06/17/2022

Complexity of the Multiobjective Spanner Problem

In this paper, we take an in-depth look at the complexity of a hitherto ...
research
06/12/2023

Fitch Graph Completion

Horizontal gene transfer is an important contributor to evolution. Accor...
research
08/21/2017

Approximating the Minimum k-Section Width in Bounded-Degree Trees with Linear Diameter

Minimum k-Section denotes the NP-hard problem to partition the vertex se...

Please sign up or login with your details

Forgot password? Click here to reset