Loading...

Algorithmic complexity of proper labeling problems

Dehghan, A ; Sharif University of Technology | 2013

680 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.tcs.2013.05.027
  3. Publisher: 2013
  4. Abstract:
  5. A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The problem of proper labeling offers many variants and received a great interest during recent years. We consider the algorithmic complexity of some variants of the proper labeling problems, we present some polynomial time algorithms and NP-completeness results for them
  6. Keywords:
  7. Computational complexity ; Fictional coloring ; Gap vertex-distinguishing edge colorings ; Multiplicative 1, 2, 3-conjecture ; Multiplicative vertex-coloring weightings ; Proper labeling ; Algorithmic complexity ; Edge coloring ; Np-completeness ; Polynomial-time algorithms ; Vertex-coloring ; Computer science ; Vertex-labeling by maximum 1, 2, 3-Conjecture
  8. Source: Theoretical Computer Science ; Volume 495 , 2013 , Pages 25-36 ; 03043975 (ISSN)
  9. URL: http://www.sciencedirect.com/science/article/pii/S0304397513003988