
A Maximum Linear Arrangement Problem on Directed Graphs
We propose a new arrangement problem on directed graphs, Maximum Directe...
read it

Reconfiguration of Spanning Trees with Many or Few Leaves
Let G be a graph and T_1,T_2 be two spanning trees of G. We say that T_1...
read it

On the existence of a cherrypicking sequence
Recently, the minimum number of reticulation events that is required to ...
read it

The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)
We study several problems of clearing subgraphs by mobile agents in digr...
read it

Cartesian trees and Lyndon trees
The article describes the structural and algorithmic relations between C...
read it

Determining the Hausdorff Distance Between Trees in Polynomial Time
The Hausdorff distance is a relatively new measure of similarity of grap...
read it

Finding Diverse Trees, Paths, and More
Mathematical modeling is a standard approach to solve many realworld pr...
read it
Reconfiguring Directed Trees in a Digraph
In this paper, we investigate the computational complexity of subgraph reconfiguration problems in directed graphs. More specifically, we focus on the problem of determining whether, given two directed trees in a digraph, there is a (reconfiguration) sequence of directed trees such that for every pair of two consecutive trees in the sequence, one of them is obtained from the other by removing an arc and then adding another arc. We show that this problem can be solved in polynomial time, whereas the problem is PSPACEcomplete when we restrict directed trees in a reconfiguration sequence to form directed paths. We also show that there is a polynomialtime algorithm for finding a shortest reconfiguration sequence between two directed spanning trees.
READ FULL TEXT
Comments
There are no comments yet.