Pages that link to "Item:Q1288471"
From MaRDI portal
The following pages link to Simple efficient graph compression schemes for dense and complement graphs (Q1288471):
Displaying 10 items.
- Simple DFS on the complement of a graph and on partially complemented digraphs (Q318918) (← links)
- Clique partitions, graph compression and speeding-up algorithms (Q1900930) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- Compression of dynamic graphs generated by a duplication model (Q2196614) (← links)
- Data compression in big graph warehouse (Q2199370) (← links)
- Reachability preserving compression for dynamic graph (Q2660982) (← links)
- Compressing Bounded Degree Graphs (Q2802953) (← links)
- Speeding up Graph Algorithms via Switching Classes (Q2946059) (← links)
- 基于图压缩的最大Steiner连通 k 核查询处理 (Q2984841) (← links)
- Compressed Weighted de Bruijn Graphs (Q6098787) (← links)