Graph compression and the zeros of polynomials (Q834888): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2004.06.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2085667426
@@ Property / OpenAlex ID: W2085667426 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4471358
@@ Property / cites work: Q4471358 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768340
@@ Property / cites work: Q2768340 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
+Normal rank
@@ Property / cites work @@
+Representation of graphs
@@ Property / cites work: Representation of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
+Normal rank
@@ Property / cites work @@
+Q3992465
@@ Property / cites work: Q3992465 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4002529
@@ Property / cites work: Q4002529 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4282674
@@ Property / cites work: Q4282674 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct Representation of Balanced Parentheses and Static Trees
+Normal rank
@@ Property / cites work @@
+Succinct representation of general unlabeled graphs
+Normal rank
@@ Property / cites work @@
+Q4023358
@@ Property / cites work: Q4023358 / rank @@
+Normal rank