Flip distances between graph orientations

02/16/2019
by   Oswin Aichholzer, et al.
0

Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in triangulations of a convex polygon. For some definition of a flip graph, a natural computational problem to consider is the flip distance: Given two objects, what is the minimum number of flips needed to transform one into the other? We consider flip graphs on orientations of simple graphs, where flips consist of reversing the direction of some edges. More precisely, we consider so-called α-orientations of a graph G, in which every vertex v has a specified outdegree α(v), and a flip consists of reversing all edges of a directed cycle. We prove that deciding whether the flip distance between two α-orientations of a planar graph G is at most two is -complete. This also holds in the special case of perfect matchings, where flips involve alternating cycles. This problem amounts to finding geodesics on the common base polytope of two partition matroids, or, alternatively, on an alcoved polytope. It therefore provides an interesting example of a flip distance question that is computationally intractable despite having a natural interpretation as a geodesic on a nicely structured combinatorial polytope. We also consider the dual question of the flip distance betwe en graph orientations in which every cycle has a specified number of forward edges, and a flip is the reversal of all edges in a minimal directed cut. In general, the problem remains hard. However, if we restrict to flips that only change sinks into sources, or vice-versa, then the problem can be solved in polynomial time. Here we exploit the fact that the flip graph is the cover graph of a distributive lattice. This generalizes a recent result from Zhang, Qian, and Zhang.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/26/2018

Finding a Maximum-Weight Convex Set in a Chordal Graph

We consider a natural combinatorial optimization problem on chordal grap...
research
03/07/2019

Colouring Non-Even Digraphs

A colouring of a digraph as defined by Erdos and Neumann-Lara in 1980 is...
research
04/14/2022

On restricted completions of chordal and trivially perfect graphs

Let G be a graph having a vertex v such that H = G - v is a trivially pe...
research
08/11/2022

Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification

In the Directed Steiner Network problem, the input is a directed graph G...
research
02/19/2018

Reconfiguration of Colorable Sets in Classes of Perfect Graphs

A set of vertices in a graph is c-colorable if the subgraph induced by t...
research
08/24/2020

Odd wheels are not odd-distance graphs

An odd wheel graph is a graph formed by connecting a new vertex to all v...
research
03/22/2021

Continuous mean distance of a weighted graph

We study the concept of the continuous mean distance of a weighted graph...

Please sign up or login with your details

Forgot password? Click here to reset