Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs

Ming-Yang Kao (), Neill Occhiogrosso () and Shang-Hua Teng ()
Additional contact information
Ming-Yang Kao: Yale University
Neill Occhiogrosso: Duke University
Shang-Hua Teng: University of Illinois at Urbana-Champaign

Journal of Combinatorial Optimization, 1998, vol. 2, issue 4, No 4, 359 pages

Abstract: 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 (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1009720402326 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:2:y:1998:i:4:d:10.1023_a:1009720402326

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009720402326

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().