Construction of optimal graphs for bit-vector compression

This publication has 12 references indexed in Scilit:

• Using bitmaps for medium sized information retrieval systems
  Information Processing & Management, 1990
• Modeling for text compression
  ACM Computing Surveys, 1989
• Storing text retrieval systems on CD-ROM: compression and encryption considerations
  ACM Transactions on Information Systems, 1989
• Data compression
  ACM Computing Surveys, 1987
• Improved hierarchical bit-vector compression in document retrieval systems
  Published by Association for Computing Machinery (ACM) ,1986
• Signature files
  ACM Transactions on Information Systems, 1984
• Huffman coding in bit-vector compression
  Information Processing Letters, 1978
• An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
  Information Processing Letters, 1975
• Mathematical analysis of various superimposed coding methods
  American Documentation, 1960
• On the shortest spanning subtree of a graph and the traveling salesman problem
  Proceedings of the American Mathematical Society, 1956