configurable graph summarization 1graph reconstruction 1lossless and lossy compression 1neighborhood loss tolerance 1query support 1
From the 1 of 2 linked papers with an AI index.
2 papers
cs.DS2026
CGS: Configurable Graph Summarization with Bounded Neighborhood Loss and Query Support
Shubhadip Mitra, Sona Elza Simon, C Oswald +2
The paper introduces CGS, a configurable graph summarization framework that lets users choose lossless or lossy compression with a bounded neighborhood loss tolerance, while still…
cs.DS2024
RSVP: Beyond Weisfeiler Lehman Graph Isomorphism Test
Sourav Dutta, Arnab Bhattacharya
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not…