ISAAC 2013: Algorithms and Computation pp 196-206

# Hardness and Algorithms for Variants of Line Graphs of Directed Graphs

• Laurent Beaudou
• Zhentao Li
• Vincent Limouzy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8283)

## Abstract

Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs share a common node that is the tail of at least one of these arcs. We call them facility location graphs since they arise from the classical uncapacitated facility location problem. In this paper we show that facility location graphs are hard to recognize but they are easy to recognize when the underlying graph is triangle-free. We also determine the complexity of the vertex coloring, the stable set and the facility location problem for triangle-free facility location graphs.

## Keywords

Directed Graph Undirected Graph Facility Location Line Graph Intersection Graph
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 1.
De Simone, C., Mannino, C.: Easy instances of the plant location problem. Technical Report R. 427, IASI, CNR (1996)Google Scholar
2. 2.
Avella, P., Sassano, A.: On the p-median polytope. Mathematical Programming 89, 395–411 (2001)
3. 3.
Cornuejols, G., Thizy, J.M.: Some facets of the simple plant location polytope. Math. Program. 23, 50–74 (1982)
4. 4.
Chvátal, V., Ebenegger, C.: A note on line digraphs and the directed max-cut problem. Discrete Applied Mathematics 29, 165–170 (1990)
5. 5.
Balas, E.: The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics 2, 425–451 (1989)
6. 6.
Beineke, L.W.: Characterizations of derived graphs. Journal of Combinatorial Theory 9, 129–135 (1970)
7. 7.
Baïou, M., Beaudou, L., Li, Z., Limouzy, V.: On a class of intersection graphs (2013), http://arxiv.org/abs/1306.2498
8. 8.
Holyer, I.: The np-completeness of edge-coloring. SIAM Journal on Computing 10, 718–720 (1981)
9. 9.
Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae 15, 307–309 (1974)
10. 10.
Mohar, B.: Face covers and the genus problem for apex graphs. J. Comb. Theory, Ser. B 82, 102–117 (2001)