Succinct dual clique cover representations allow fundamental graph algorithms to run in time proportional to the representation size instead of the number of edges, delivering substantial memory savings and speedups on real-world graphs with dense local cliques.
Surveyandtaxonomyoflosslessgraphcompressionandspace-efficient graph representations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Succinct Graph Representations and Algorithmic Applications
Succinct dual clique cover representations allow fundamental graph algorithms to run in time proportional to the representation size instead of the number of edges, delivering substantial memory savings and speedups on real-world graphs with dense local cliques.