基于图压缩的最大Steiner连通 k 核查询处理

DOI10.13328/j.cnki.jos.005044zbMath1374.68167OpenAlexW2619813707MaRDI QIDQ2984841

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

query processinggraph compressioncompression ratioequivalent classmaximum Steiner connected \(k\)-core

Mathematics Subject Classification ID

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

Related Items (2)

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

This page was built for publication: 基于图压缩的最大Steiner连通 k 核查询处理