Maximum Steiner connected \(k\)-core query processing based on graph compression (Q2984841)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum Steiner connected k-core query processing based on graph compression |
scientific article; zbMATH DE number 6719490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum Steiner connected \(k\)-core query processing based on graph compression |
scientific article; zbMATH DE number 6719490 |
Statements
17 May 2017
0 references
maximum Steiner connected \(k\)-core
0 references
graph compression
0 references
equivalent class
0 references
query processing
0 references
compression ratio
0 references
基于图压缩的最大Steiner连通 k 核查询处理 (English)
0 references
0.7070050835609436
0 references
0.7032148838043213
0 references
0.7024099230766296
0 references
0.6906587481498718
0 references
