Abstract
Given a graph \(G = (V,E)\) of order n and maximum degree \(\varDelta \), the NP-complete S-labeling problem consists in finding a labeling of G, i.e. a bijective mapping \(\phi : V \rightarrow \{1, 2 \ldots n\}\), such that \(\mathrm{SL}_{\phi }(G)=\sum _{\{u,v\} \in E} \min \{\phi (u), \phi (v)\}\) is minimized. A preliminary study of the S-labeling problem has been undertaken in [9]; here, we prolongate this study, and focus more specifically on algorithmic results concerning the problem. We first give intrinsic properties of optimal labelings, which will prove useful for our algorithmic study. We then show that the S-Labeling problem is polynomial-time solvable for (sets of) caterpillars. We also provide upper and lower bounds on \(\mathrm{SL}_{\phi }(G)\), that in turn allow us to determine polynomial-time approximation algorithms for different classes of graphs such as regular graphs, connected graphs and forests, but also for general graphs. Concerning exact algorithms, we show that the problem is solvable in \(O^*(1.44225^{n\varDelta })\) time, and that deciding whether there exist a labeling \(\phi \) of G such that \(\mathrm{SL}_{\phi }(G) \le |E| + k\) is solvable in \(O^*(2^{2\sqrt{k}}\ (2 \sqrt{k})!)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adolphson, D.: Single machine job sequencing with precedence constraints. SIAM J. Comput. 6, 40–54 (1977)
Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25(3), 403–423 (1973)
Bezrukov, S.: Edge isoperimetric problems on graphs. In: Lovasz, L., Gyárfás, A., Katona, B.O.H., Recski, A., Szekely, L. (eds.) Graph Theory and Combinatorial Biology, pp. 157–197. Janos Bolyai Mathematical Society, Budapest (1999)
Bhatt, S.N., Leighton, F.T.: A framework for solving VLSI graph layout problems. J. Comput. Syst. Sci. 28, 300–343 (1984)
Chung, F.R.K.: Labeling of graphs. In: Wilson, R.J., Beineke, L.W. (eds.) Selected Topics in Graph Theory, vol. 3, pp. 151–168. Academic Press, London (1988)
Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the Lambert W function. Adv. Comput. Math. 5, 329–359 (1996)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
Dìaz, J., Petit, J., Serna, M.: A survey on graph layout problems. J. ACM Comput. Surv. (CSUR) 34(3), 313–356 (2002)
Fertin, G., Vialette, S.: On the \({S}\)-labeling problem. In: Proceedings of the 5th European Conference on Combinatorics, Graph Theory and Applications (EuroComb). Electronic Notes on Discrete Mathematics, vol. 34, pp. 273–277 (2009)
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore, London (1996)
Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. Theor. Comput. Syst. 41(3), 521–538 (2007). Erratum-ibid [12]
Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: Corrigendum. the linear arrangement problem parameterized above guaranteed value. Theor. Comput. Syst. 53(4), 690–691 (2013)
Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. SIAM J. 12(1), 131–135 (1964)
Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Inf. Process. Lett. 27, 119–123 (1988)
Karger, D.R.: A randomized fully polynomial approximation scheme for all terminal network reliability problem. In: 27th ACM Symposium on Theory of Computing (STOC), pp. 11–17 (1995)
Karp, R.M.: Mapping the genome: some combinatorial problem arising in molecular biology. In: 24th ACM Symposium on Theory of Computing (STOC), pp. 278–285 (1993)
Kitaev, S.: Iterative Methods for Sparse Linear Systems, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2003)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1993)
Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177–189 (1979)
Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335–354 (1999)
Niedermeier, R.: Invitation to Fixed Parameter Algorithms. Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2006)
Vialette, S.: Packing of \((0, 1)\)-matrices. Theor. Inform. Appl. RAIRO 40(4), 519–536 (2006)
Wilf, H.S.: On the number of maximal independent sets in a tree. SIAM J. Algebraic Discrete Methods 7(1), 125–130 (1986)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Fertin, G., Rusu, I., Vialette, S. (2016). Algorithmic Aspects of the S-Labeling Problem. In: Lipták, Z., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2015. Lecture Notes in Computer Science(), vol 9538. Springer, Cham. https://doi.org/10.1007/978-3-319-29516-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-29516-9_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29515-2
Online ISBN: 978-3-319-29516-9
eBook Packages: Computer ScienceComputer Science (R0)