Summary
In this paper we find a particular partition of the vertex set of claw-free strongly chordal graphs in which each element is a clique, and we show that the adjacency graph of these cliques is a tree. In particular, the presented results imply the existence of an ordering of the vertices, and a corresponding edge orientation, such that each directed path is contained in at most two maximal cliques. As shown by the authors in previous works, this allows to give performance guarantee approximation results on a wide class of optimization problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.R.S. Blair (1993), “The efficiency of AC graphs”, Discr. Appl. Math. 44, pp. 119–138.
G.J. Chang (1982), “K-domination and graph covering problems”, Ph.D. thesis, School of ORand IE, Cornell Univ., Ithaca, New York.
G. Confessore, P. Dell’Olmo and S. Giordani (1998), “An approximation result for a bandwidthallocation problem”, in Operations Research Proceedings 1997, P. Kischka et al. eds., Springer-Verlag, pp. 126–131.
G. Confessore, P. Dell’Olmo and S. Giordani (1997), “An approximation algorithm for ProperDynamic Storage Allocation”, Tech. Rep. IASI-CNR N.448, Rome, Italy.
[5] P. Dell’Olmo, S. Giordani and M.G. Speranza (1997), “An approximation result for a duo-processor task scheduling problem”, Inf. Proc. Lett., 61, pp. 195–200.
P. Dell’Olmo, M.G. Speranza and Zs. Tuza (1997), “Comparability graph augmentation for some multiprocessor scheduling problems”, Discr. Appl. Math., 72, pp. 71–84.
M. Farber (1983), “Characterizations of strongly chordal graphs”, Discr. Math., 43, pp. 173–189.
M.C. Golumbic (1980), Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Confessore, G., Dell’Olmo, P., Giordani, S. (1999). Partitioning Cliques of Claw-Free Strongly Chordal Graphs. In: Kall, P., Lüthi, HJ. (eds) Operations Research Proceedings 1998. Operations Research Proceedings 1998, vol 1998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58409-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-58409-1_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65381-3
Online ISBN: 978-3-642-58409-1
eBook Packages: Springer Book Archive