IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v2y1998i4d10.1023_a1009720402326.html
   My bibliography  Save this article

Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs

Author

Listed:
  • Ming-Yang Kao

    (Yale University)

  • Neill Occhiogrosso

    (Duke University)

  • Shang-Hua Teng

    (University of Illinois at Urbana-Champaign
    University of Minnesota)

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.

Suggested Citation

  • Ming-Yang Kao & Neill Occhiogrosso & Shang-Hua Teng, 1998. "Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs," Journal of Combinatorial Optimization, Springer, vol. 2(4), pages 351-359, December.
    • Handle: RePEc:spr:jcomop:v:2:y:1998:i:4:d:10.1023_a:1009720402326
    DOI: 10.1023/A:1009720402326
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009720402326
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009720402326?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ming-Yang Kao, 1997. "Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants," Journal of Combinatorial Optimization, Springer, vol. 1(2), pages 187-202, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:2:y:1998:i:4:d:10.1023_a:1009720402326. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.