Set-based approximate approach for lossless graph summarization

Title
Set-based approximate approach for lossless graph summarization
Authors
Keywords
Graph summarization, LSH, MDL, Degree similarity, Auto pruning, 68W25, 05C07, 05C85, 68P30
Journal
COMPUTING
Volume 97, Issue 12, Pages 1185-1207
Publisher
Springer Nature
Online
2015-04-27
DOI
10.1007/s00607-015-0454-9

Ask authors/readers for more resources

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started