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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
De Simone, C., Mannino, C.: Easy instances of the plant location problem. Technical Report R. 427, IASI, CNR (1996)
Avella, P., Sassano, A.: On the p-median polytope. Mathematical Programming 89, 395–411 (2001)
Cornuejols, G., Thizy, J.M.: Some facets of the simple plant location polytope. Math. Program. 23, 50–74 (1982)
Chvátal, V., Ebenegger, C.: A note on line digraphs and the directed max-cut problem. Discrete Applied Mathematics 29, 165–170 (1990)
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)
Beineke, L.W.: Characterizations of derived graphs. Journal of Combinatorial Theory 9, 129–135 (1970)
Baïou, M., Beaudou, L., Li, Z., Limouzy, V.: On a class of intersection graphs (2013), http://arxiv.org/abs/1306.2498
Holyer, I.: The np-completeness of edge-coloring. SIAM Journal on Computing 10, 718–720 (1981)
Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae 15, 307–309 (1974)
Mohar, B.: Face covers and the genus problem for apex graphs. J. Comb. Theory, Ser. B 82, 102–117 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baïou, M., Beaudou, L., Li, Z., Limouzy, V. (2013). Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. In: Cai, L., Cheng, SW., Lam, TW. (eds) Algorithms and Computation. ISAAC 2013. Lecture Notes in Computer Science, vol 8283. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45030-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-45030-3_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45029-7
Online ISBN: 978-3-642-45030-3
eBook Packages: Computer ScienceComputer Science (R0)