Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100): Difference between revisions

@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+Extended Compact Web Graph Representations
@@ Property / cites work: Extended Compact Web Graph Representations / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Compression of Web Graphs
@@ Property / cites work: Efficient Compression of Web Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph compression by BFS
@@ Property / cites work: Graph compression by BFS / rank @@
+Normal rank
@@ Property / cites work @@
+A partial characterization of clique graphs
@@ Property / cites work: A partial characterization of clique graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of clique graphs
@@ Property / cites work: A characterization of clique graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
+Normal rank
@@ Property / cites work @@
+A Method for the Construction of Minimum-Redundancy Codes
+Normal rank