Advertisement

Journal of Combinatorial Optimization

, Volume 2, Issue 4, pp 351–359 | Cite as

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs

  • Ming-Yang Kao
  • Neill Occhiogrosso
  • Shang-Hua Teng
Article

Abstract

We present two graph compression schemes for solving problems on dense graphs and complement graphs. They compress a graph or its complement graph into two kinds of succinct representations based on adjacency intervals and adjacency integers, respectively. These two schemes complement each other for different ranges of density. Using these schemes, we develop optimal or near optimal algorithms for fundamental graph problems. In contrast to previous graph compression schemes, ours are simple and efficient for practical applications.

Keywords

Mathematical Modeling Optimal Algorithm Industrial Mathematic Discrete Geometry Compression Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley: Reading, MA, 1974.Google Scholar
  2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, Data Structures and Algorithms, Addison-Wesley: Reading, MA, 1983.Google Scholar
  3. V.L. Arlazarov, E.A. Dinic, M.A. Kronrod, and I.A. Faradzev, “On economical construction of the transitive closure of a directed graph,” Dokl. Akad. Nauk SSSR, vol. 194, pp. 487–488, 1970.Google Scholar
  4. J. Cheriyan, M.Y. Kao, and R. Thurimella, “Scan-first search and sparse certificates: An improved parallel algorithm for k-vertex connectivity,” SIAM Journal on Computing, vol. 22, no.1, pp. 157–174, 1993.Google Scholar
  5. T.H. Cormen, C.L. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press: Cambridge, MA, 1991.Google Scholar
  6. T. Feder and R. Motwani, “Clique partitions, graph compression, and speeding-up algorithms,” in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 123–133.Google Scholar
  7. M.L. Fredman and M.E. Saks, “The cell probe complexity of dynamic data structures,” in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 345–354.Google Scholar
  8. H.N. Gabowand R.E. Tarjan, “A linear-time algorithm for a special case of disjoint set union,” Journal of Computer and System Sciences, vol. 30, no.2, pp. 209–221, 1985.Google Scholar
  9. D. Gusfield, “A graph theoretic approach to statistical data security,” SIAM Journal on Computing, vol. 17, pp. 552–571, 1988.Google Scholar
  10. E. Horowitz and S. Sahni, Fundamentals of Data Structures, Computer Science Press: New York, 1976.Google Scholar
  11. M.Y. Kao, “Data security equals graph connectivity,” SIAM Journal on Discrete Mathematics, vol. 9, pp. 87–100, 1996.Google Scholar
  12. M.Y. Kao, “Efficient detection and protection of information in cross tabulated tables II: Minimal linear invariants,” Journal of Combinatorial Optimization, vol. 1, pp. 187–202, 1997a.Google Scholar
  13. M.Y. Kao, “Total protection of analytic-invariant information in cross-tabulated tables,” SIAM Journal on Computing, vol. 26, no.1, pp. 231–242, 1997b.Google Scholar
  14. M.Y. Kao and D. Gusfield, “Efficient detection and protection of information in cross tabulated tables I: Linear invariant test,” SIAM Journal on Discrete Mathematics, vol. 6, pp. 460–476, 1993.Google Scholar
  15. R. Sedgewick, Algorithms, Addison-Wesley: Reading, MA, 1988.Google Scholar
  16. R.E. Tarjan, “Depth-first search and linear graph algorithms,” SIAM Journal on Computing, vol. 1, pp. 146–160, 1972.Google Scholar
  17. R.E. Tarjan, “Efficiency of a good but not linear set union algorithm,” Journal of the ACM, vol. 22, no.2, pp. 215–225, 1975.Google Scholar
  18. R.E. Tarjan, “A class of algorithms which require nonlinear time to maintain disjoint sets,” Journal of Computer and System Sciences, vol. 18, no.2, pp. 110–127, 1979.Google Scholar
  19. R.E. Tarjan, Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.Google Scholar

Copyright information

© Kluwer Academic Publishers 1998

Authors and Affiliations

  • Ming-Yang Kao
    • 1
  • Neill Occhiogrosso
    • 2
  • Shang-Hua Teng
    • 3
    • 4
  1. 1.Department of Computer ScienceYale UniversityNew Haven
  2. 2.Department of Computer ScienceDuke UniversityDurham
  3. 3.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbana
  4. 4.Department of Computer ScienceUniversity of MinnesotaMinneapolis

Personalised recommendations