Pages that link to "Item:Q904121"
From MaRDI portal
The following pages link to Set-based approximate approach for lossless graph summarization (Q904121):
Displaying 4 items.
- Faster compression methods for a weighted graph using locality sensitive hashing (Q780991) (← links)
- Graph summarization with quality guarantees (Q1741300) (← links)
- The minimum description length principle for pattern mining: a survey (Q2097441) (← links)
- Summarized bit batch-based triangle listing in massive graphs (Q2195476) (← links)