2 papers
cs.DS2026
CGS: Configurable Graph Summarization with Bounded Neighborhood Loss and Query Support
Shubhadip Mitra, Sona Elza Simon, C Oswald +2
Given a large graph, how to generate a compact summary graph that is configurable by the user and supports multiple graph queries with either no loss or with high accuracy? The eve…
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…