On the S-Labeling problem

https://doi.org/10.1016/j.endm.2009.07.044Get rights and content

Abstract

Let G be a graph of order n and size m. A labeling of G is a bijective mapping θ:V(G){1,2,,n}, and we call Θ(G) the set of all labelings of G. For any graph G and any labeling θΘ(G), let SL(G,θ)=eE(G) min{θ(u):ue}. In this paper, we consider the S-Labeling problem, defined as follows: Given a graph G, find a labeling θΘ(G) that minimizes SL(G,θ). The S-Labeling problem has been shown to be NP-complete [S. Vialette, Packing of (0, 1)-matrices, Theoretical Informatics and Applications RAIRO 40 (2006), no. 4, 519–536]. We prove here basic properties of any optimal S-labeling of a graph G, and relate it to the Vertex Cover problem. Then, we derive bounds for SL(G,θ), and we give approximation ratios for different families of graphs. We finally show that the S-Labeling problem is polynomial-time solvable for split graphs.

Due to space constraints, proofs are totally absent from this paper. They will be available in its journal version.

References (3)

  • R. Diestel

    Graph theory

    (2000)
There are more references available in the full text version of this article.

Cited by (5)

  • Algorithmic expedients for the S-labeling problem

    2019, Computers and Operations Research
  • The S-LABELING problem: An algorithmic tour

    2018, Discrete Applied Mathematics
  • Algorithmic aspects of the S-labeling problem

    2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View full text