On Assigning Prefix Free Codes to the Vertices of a Graph

  • N. S. Narayanaswamy
  • C. E. Veni Madhavan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2108)

Abstract

For a graph G on n vertices, with positive integer weights w 1,...,w n assigned to the n vertices such that, for every clique K of G, \( \sum\limits_{i \in K} {\frac{1} {{2^{w_i } }}} \leqslant 1 \), the problem we are interested in is to assign binary codes C1,...,C n to the vertices such that C i has w i (or a function of w i) bits in it and, for every edge i, j, C i and C j are not prefixes of each other.We call this the Graph Prefix Free Code Assignment Problem. We relate this new problem to the problem of designing adversaries for comparison based sorting algorithms. We show that the decision version of this problem is as hard as graph colouring and then present results on the existence of these codes for prefect graphs and its subclasses.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Devdutt Dubashi, and K.V. Subrahmanyam, Notes on Prefix-free codes, Entropy and Sorting. Personal Communication Google Scholar
  2. 2.
    Jeff Kahn, and Jeong Han Kim, Entropy and Sorting. 24th Annual ACM STOC, pp178–187, 1992 Google Scholar
  3. 3.
    Martin Grostshcel, Laszlo Lovasz, Alexander Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer VerlagGoogle Scholar
  4. 4.
    J.A. Bondy, and U.S.R. Murthy Graph Theory with Applications. Elsevier North Holland 1976 Google Scholar
  5. 5.
    Martin C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980 Google Scholar
  6. 6.
    M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. (Freeman, San Fransisco, CA, 19 79)Google Scholar
  7. 7.
    G.S. Brodal, Shiva Chaudhuri, J. Radhakrishnan, The Randomized Complexity of Maintaining the Minimum. Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT’96), 3(4):337–351, 1996.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • N. S. Narayanaswamy
    • 1
  • C. E. Veni Madhavan
    • 2
  1. 1.Institut für InformatikLudwig Maximilians UniversitätMunichGermany
  2. 2.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations