Reachability preserving compression for dynamic graph (Q2660982): Difference between revisions

@@ Property / describes a project that uses @@
+SNAP
@@ Property / describes a project that uses: SNAP / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ins.2020.02.028
+Normal rank
@@ Property / OpenAlex ID @@
+W3005994946
@@ Property / OpenAlex ID: W3005994946 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024792
@@ Property / cites work: Q3024792 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic shortest paths and transitive closure: algorithmic techniques and data structures
+Normal rank
@@ Property / cites work @@
+Q3138871
@@ Property / cites work: Q3138871 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252752
@@ Property / cites work: Q4252752 / rank @@
+Normal rank
@@ Property / cites work @@
+基于图压缩的最大Steiner连通 k 核查询处理
+Normal rank
@@ Property / cites work @@
+A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time
+Normal rank
@@ Property / cites work @@
+A strong-connectivity algorithm and its applications in data flow analysis
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank