Maximum Steiner connected k-core query processing based on graph compression

DOI10.13328/J.CNKI.JOS.005044MaRDI QIDQ2984841zbMATH OpenOpenAlexFDO

Authors Mingpeng Li, Hong Gao, Zhao-Nian Zou

Publication date 17 May 2017

Full work available at URL http://jos.org.cn/html/2016/9/5044.htm

zbMATH Keywords

compression ratioequivalent classgraph compressionmaximum Steiner connected \(k\)-corequery processing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for image processing (68U10)

Recommendations

• Reachability preserving compression for dynamic graph
• Simple efficient graph compression schemes for dense and complement graphs
• Clique partitions, graph compression and speeding-up algorithms
• Simple and efficient graph compression schemes for dense and complement graphs
• Graph summarization with quality guarantees

Cited in

(2)

• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
• Reachability preserving compression for dynamic graph

This page was built for publication: Maximum Steiner connected \(k\)-core query processing based on graph compression

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