Reachability preserving compression for dynamic graph (Q2660982): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3024792 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic shortest paths and transitive closure: algorithmic techniques and data structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138871 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 基于图压缩的最大Steiner连通 k 核查询处理 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A strong-connectivity algorithm and its applications in data flow analysis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank |
Latest revision as of 22:42, 24 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reachability preserving compression for dynamic graph |
scientific article |
Statements
Reachability preserving compression for dynamic graph (English)
0 references
31 March 2021
0 references
query preserving graph compression
0 references
compressed graph maintenance
0 references
dynamic graph
0 references
graph query
0 references
0 references
0 references