Simple efficient graph compression schemes for dense and complement graphs

DOI10.1023/A:1009720402326MaRDI QIDQ1288471zbMATH OpenWikidataFDO

Authors Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng

Publication date 9 February 2001

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

dense graphscomplement graphsgraph compression schemes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1555964
• Clique partitions, graph compression and speeding-up algorithms
• Graph compression by BFS

Cited in

(12)

• Reachability preserving compression for dynamic graph
• Speeding up Graph Algorithms via Switching Classes
• Compact structure for sparse undirected graphs based on a clique graph partition
• Simple DFS on the complement of a graph and on partially complemented digraphs
• scientific article; zbMATH DE number 1555964 (Why is no real title available?)
• Compressed Weighted de Bruijn Graphs
• Fast algorithm for optimal compression of graphs
• Clique partitions, graph compression and speeding-up algorithms
• Compression of dynamic graphs generated by a duplication model
• Data compression in big graph warehouse
• Maximum Steiner connected \(k\)-core query processing based on graph compression
• Compressing Bounded Degree Graphs

This page was built for publication: Simple 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 Q1288471)