Set-based approximate approach for lossless graph summarization

DOI10.1007/S00607-015-0454-9zbMath1347.68370OpenAlexW2036032872MaRDI QIDQ904121

Young-Koo Lee, Waqas Nawaz, Kifayat Ullah Khan

Publication date: 15 January 2016

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-015-0454-9

zbMATH Keywords

MDLgraph summarizationauto-pruningdegree similarityLSH

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Vertex degrees (05C07)

Related Items (2)

Summarized bit batch-based triangle listing in massive graphs ⋮ The minimum description length principle for pattern mining: a survey

Uses Software

• gSpan
• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Modeling by shortest data description
• Summarizing and understanding large graphs

This page was built for publication: Set-based approximate approach for lossless graph summarization