aggregate-invariants

This paper investigates whether aggregate structural invariants, specifically spectral bounds, can accelerate continuous subgraph matching (CSM) over dynamic graphs. It characterizes limitations of lazy spectral maintenance, shows exact maintenance is affordable when selective, and demonstrates pruning power of up to 51% in benchmarks.