Succinct Graph Representations and Algorithmic Applications

Ahammed Ullah, Alex Pothen

We propose new graph representations that exploit dense local structure to improve time and space simultaneously. Given an undirected graph $G$, we define a dual clique cover (DCC)…