Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Distance-Preserving Graph Compression Techniques (2307.05829v1)

Published 11 Jul 2023 in cs.DS and cs.DM

Abstract: We study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G = (V, E)$ with non-negative weights, and a subset of edges $E{\prime} \subset E$ which needs to be removed from G (with their endpoints merged as a supernode). The goal is to redistribute the weights of the deleted edges in a way that minimizes the error. The error is defined as the sum of the absolute differences of the shortest path lengths between different pairs of nodes before and after contracting $E{\prime}$. Based on this error function, we propose optimal approaches for merging any subset of edges in a path and a single edge in a tree. Previous works on graph compression techniques aimed at preserving different graph properties (such as the chromatic number) or solely focused on identifying the optimal set of edges to contract. However, our focus in this paper is on achieving optimal edge contraction (when the contracted edges are provided as input) specifically for weighted trees and paths.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (30)
  1. A hub-based labeling algorithm for shortest paths in road networks. In Experimental Algorithms: 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings 10, pages 230–241. Springer, 2011.
  2. Parallel shortest path big data graph computations of US road network using apache spark: survey, architecture, and evaluation. Smart Infrastructure and Applications: Foundations for Smarter Cities and Societies, pages 185–214, 2020.
  3. Blockers for the stability number and the chromatic number. Graphs and Combinatorics, 31:73–90, 2015.
  4. The most vital nodes with respect to independent set and vertex cover. Discrete Applied Mathematics, 159(17):1933–1946, 2011.
  5. Distance-preserving graph contractions. SIAM journal on Discrete Mathematics, 33(3):1607–1636, 2019.
  6. Simplifying flow networks. In Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28–September 1, 2000 Proceedings, pages 192–201. Springer, 2001.
  7. One trillion edges: Graph processing at facebook-scale. Proceedings of the VLDB Endowment, 8(12):1804–1815, 2015.
  8. Minimum d-blockers and d-transversals in graphs. Journal of Combinatorial Optimization, 22:857–872, 2011.
  9. Contraction and deletion blockers for perfect graphs and h-free graphs. Theoretical computer science, 746:49–72, 2018.
  10. Graph modification problems: A modern perspective. In Frontiers in Algorithmics: 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings 9, pages 3–6. Springer, 2015.
  11. Reducing the domination number of graphs via edge contractions and vertex deletions. Discrete Mathematics, 344(1):112169, 2021.
  12. Blocking total dominating sets via edge contractions. Theoretical Computer Science, 877:18–35, 2021.
  13. Keyword search in graphs: finding r-cliques. Proceedings of the VLDB Endowment, 4(10):681–692, 2011.
  14. Complexity and algorithms for constant diameter augmentation problems. Theoretical Computer Science, 904:15–26, 2022.
  15. The node-deletion problem for hereditary properties is np-complete. Journal of Computer and System Sciences, 20(2):219–230, 1980.
  16. Community-diversified influence maximization in social networks. Information Systems, 92:101522, 2020.
  17. Gpugraphx: A GPU-aided distributed graph processing system. In Web Information Systems Engineering–WISE 2021: 22nd International Conference on Web Information Systems Engineering, WISE 2021, Melbourne, VIC, Australia, October 26–29, 2021, Proceedings, Part II 22, pages 501–509. Springer, 2021.
  18. Reachability preserving compression for dynamic graph. Information Sciences, 520:232–249, 2020.
  19. Reducing graph transversals via edge contractions. Journal of Computer and System Sciences, 120:62–74, 2021.
  20. Shentu: processing multi-trillion edge graphs on millions of cores in seconds. In SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pages 706–716. IEEE, 2018.
  21. Graph summarization methods and applications: A survey. ACM computing surveys (CSUR), 51(3):1–34, 2018.
  22. Minimum vertex blocker clique problem. Networks, 64(1):48–64, 2014.
  23. Distance preserving graph simplification. In 2011 IEEE 11th International Conference on Data Mining, pages 1200–1205. IEEE, 2011.
  24. Shrink: Distance preserving graph compression. Information Systems, 69:180–193, 2017.
  25. Olaf Sporns. Graph theory methods: applications in brain networks. Dialogues in clinical neuroscience, 2022.
  26. Compression of weighted graphs. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 965–973, 2011.
  27. Nenad Trinajstic. Chemical graph theory. CRC press, 2018.
  28. On the NP-Hardness of edge-deletion and-contraction problems. Discrete Applied Mathematics, 6(1):63–78, 1983.
  29. Network simplification with minimal loss of connectivity. In 2010 IEEE international conference on data mining, pages 659–668. IEEE, 2010.
  30. Approximate path searching for supporting shortest path queries on road networks. Information Sciences, 325:409–428, 2015.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now