Skip to main content
SpringerLink
Log in

Simple and efficient graph compression schemes for dense and complement graphs

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 834))

Included in the following conference series:

Abstract

In this paper, 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.

Supported in part by NSF Grant CCR-9101385.

Supported in part by AFOSR F49620-92-J-0125 and Darpa N00014-92-J-1799.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

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. 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, 194:487–488, 1970.

    Google Scholar 

  3. 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, 22(1):157–174, 1993.

    Google Scholar 

  4. T. H. Cormen, C. L. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1991.

    Google Scholar 

  5. 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, pages 123–133, 1991.

    Google Scholar 

  6. 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, pages 345–354, 1989.

    Google Scholar 

  7. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30(2):209–221, 1985.

    Google Scholar 

  8. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215–225, 1975.

    Google Scholar 

  9. R. E. Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences, 18(2):110–127, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, 27706, Durham, NC

    Ming-Yang Kao

  2. Department of Mathematics, Massachusetts Institute of Technology, 02139, Cambridge, MA

    Shang-Hua Teng

Authors
  1. Ming-Yang Kao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shang-Hua Teng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kao, MY., Teng, SH. (1994). Simple and efficient graph compression schemes for dense and complement graphs. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_211

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_211

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation