On the complexity of recognizing directed path families

A Directed Path Family is a family of subsets of some finite ground set whose members can be realized as arc sets of simple directed paths in some directed graph. In this paper we show that recognizing whether a given family is a Directed Path family is an NP-Complete problem, even when all members in the family have at most two elements. If instead of a family of subsets, we are given a collection of words from some finite alphabet, then deciding whether there exists a directed graph G such that each word in the language is the set of arcs of some path in G, is a polynomial-time solvable problem.

[1]  Alain Hertz,et al.  On some Properties of DNA Graphs , 1999, Discret. Appl. Math..

[2]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[3]  Fanica Gavril,et al.  A recognition algorithm for the intersection graphs of directed paths in directed trees , 1975, Discret. Math..

[4]  Fanica Gavril,et al.  A recognition algorithm for the intersection graphs of paths in trees , 1978, Discret. Math..

[5]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[6]  Paul D. Seymour,et al.  The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[7]  J.-C. Fournier Hypergraphes de chaines d'aretes d'un arbre , 1983, Discret. Math..

[8]  Martin Charles Golumbic,et al.  Edge and vertex intersection of paths in a tree , 1985, Discret. Math..

[9]  W. Cunningham,et al.  Matroid optimization and algorithms , 1996 .

[10]  Martin Charles Golumbic,et al.  The edge intersection graphs of paths in a tree , 1985, J. Comb. Theory, Ser. B.

[11]  David K. Smith Theory of Linear and Integer Programming , 1987 .

[12]  Jorge Luis Villar,et al.  The Underlying Graph of a Line Digraph , 1992, Discret. Appl. Math..

[13]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[14]  Paolo Giulio Franciosa,et al.  A characterization of partial directed line graphs , 2007, Discret. Math..

[15]  Satoru Fujishige,et al.  An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem , 1980, J. Comput. Syst. Sci..

[16]  Robert E. Bixby,et al.  An Almost Linear-Time Algorithm for Graph Realization , 1988, Math. Oper. Res..

[17]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[18]  Vasek Chvátal,et al.  A note on line digraphs and the directed max-cut problem , 1990, Discret. Appl. Math..

[19]  Donald K. Wagner,et al.  The Arborescence-realization Problem , 1995, Discrete Applied Mathematics.

[20]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.