Simple and efficient graph compression schemes for dense and complement graphs

DOI10.1007/3-540-58325-4_211MaRDI QIDQ4525735zbMATH OpenFDO

Authors Ming-Yang Kao, Shang-Hua Teng

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58325-4_211

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Simple efficient graph compression schemes for dense and complement graphs
• Tight and simple web graph compression for forward and reverse neighbor queries
• Clique partitions, graph compression and speeding-up algorithms
• Speeding up algorithms on compressed web graphs
• Graph compression by BFS

Cited in

(10)

• Simple efficient graph compression schemes for dense and complement graphs
• Clique partitions, graph compression and speeding-up algorithms
• Compression of dynamic graphs generated by a duplication model
• Data compression in big graph warehouse
• FCA in a logical programming setting for visualization-oriented graph compression
• Linear time algorithms for graph search and connectivity determination on complement graphs.
• Compressing Bounded Degree Graphs
• Maximum Steiner connected k-core query processing based on graph compression
• Improved compressions of cube-connected cycles networks. (Extended abstract)
• Compressed Weighted de Bruijn Graphs

This page was built for publication: Simple and efficient graph compression schemes for dense and complement graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525735)