Skip to main content
Springer Nature Link
Log in

Edge Coloring on Dynamic Graphs

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13945))

Included in the following conference series:

  • 2018 Accesses

Abstract

Graph edge coloring is a fundamental problem in graph theory and has been widely used in a variety of applications. Existing solutions for edge coloring mainly focus on static graphs. However, many graphs in real world are highly dynamic. Motivated by this, we study the dynamic edge coloring problem in this paper. Since edge coloring is NP-Complete, to obtain an effective dynamic edge coloring, we aim to incrementally maintain the edge coloring in a way such that the coloring result is consistent with one of the best approximate static edge coloring algorithms when the graph is dynamically updated. Unfortunately, our theoretical result shows that the problem of finding such dynamic graph edge coloring is unbounded. Despite this, we propose an efficient dynamic edge coloring algorithm that only explores the edges with color change and their 2-hop incident edges to maintain the coloring. Moreover, we propose some early pruning rules to further reduce the unnecessary computation. Experimental results on real graphs demonstrate the efficiency of our approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Archer, A., Lattanzi, S., Likarish, P., Vassilvitskii, S.: Indexing public-private graphs. In: Proceedings of the WWW, pp. 1461–1470 (2017)

    Google Scholar 

  2. Barenboim, L., Elkin, M.: Distributed graph coloring: fundamentals and recent developments. In: Synthesis Lectures on Distributed Computing Theory (2013)

    Google Scholar 

  3. Barenboim, L., Maimon, T.: Fully-dynamic graph algorithms with sublinear time inspired by distributed computing. In: Proceedings of ICCS, pp. 89–98 (2017)

    Google Scholar 

  4. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Borghini, F., Méndez-Díaz, I., Zabala, P.: An exact algorithm for the edge coloring by total labeling problem. Ann. Oper. Res. 286(1), 11–31 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cao, Y., Chen, G., Jing, G., Stiebitz, M., Toft, B.: Graph edge coloring: a survey. Graphs Comb. 35(1), 33–66 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cheng, M., Yin, L.: Transmission scheduling in sensor networks via directed edge coloring. In: IEEE International Conference on Communications, pp. 3710–3715 (2007)

    Google Scholar 

  8. Chierichetti, F., Epasto, A., Kumar, R., Lattanzi, S.: Efficient algorithms for public-private social networks. In: Proceedings of KDD, pp. 139–148 (2015)

    Google Scholar 

  9. Cole, R., Kowalik, L.: New linear-time algorithms for edge-coloring planar graphs. Algorithmica 50(3), 351–368 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Duan, R., He, H., Zhang, T.: Dynamic edge coloring with improved approximation. In: Chan, T.M. (ed.) Proceedings of SODA, pp. 1937–1945 (2019)

    Google Scholar 

  11. Fan, W., Liu, M., Tian, C., Ruiqi, X., Zhou, J.: Incrementalization of graph partitioning algorithms. Proc. VLDB Endow. 13(8), 1261–1274 (2020)

    Article  Google Scholar 

  12. Fan, W., Tian, C.: Incremental graph computations: doable and undoable. ACM Trans. Database Syst. 47(2), 6:1-6:44 (2022)

    Article  MathSciNet  Google Scholar 

  13. Gabow, H.N., Kariv, O.: Algorithms for edge coloring bipartite graphs and multigraphs. SIAM J. Comput. 11(1), 117–129 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  14. Gandham, S., Dawande, M., Prakash, R.: Link scheduling in wireless sensor networks: Distributed edge-coloring revisited. J. Parallel Distrib. Comput. 68(8), 1122–1134 (2008)

    Article  MATH  Google Scholar 

  15. Hao, K., Yuan, L., Zhang, W.: Distributed hop-constrained s-t simple path enumeration at billion scale. Proc. VLDB Endow. 15(2), 169–182 (2021)

    Article  Google Scholar 

  16. Hilgemeier, M., Drechsler, N., Drechsler, R.: Fast heuristics for the edge coloring of large graphs. In: Proceedings of DSD, pp. 230–239 (2003)

    Google Scholar 

  17. Holyer, I.: The np-completeness of edge-coloring. SIAM J. Comput. 10(4), 718–720 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  18. Karloff, H.J., Shmoys, D.B.: Efficient parallel algorithms for edge coloring problems. J. Algorithms 8(1), 39–52 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  19. Khurana, U., Nguyen, V.-A., Cheng, H.-C., (Stephen) Chen, X., Shneiderman, B.: Visual analysis of temporal trends in social networks using edge color coding and metric timelines. In: Proceedings of IEEE PASSAT/SocialCom, pp. 549–554 (2011)

    Google Scholar 

  20. Kowalik, L.: Improved edge-coloring with three colors. Theor. Comput. Sci. 410(38–40), 3733–3742 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W.: Efficient (\(\alpha \), \(\beta \))-core computation: an index-based approach. In: Proceedings of WWW, pp. 1130–1141 (2019)

    Google Scholar 

  22. Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient (\(\alpha \), \(\beta \))-core computation in bipartite graphs. VLDB J. 29(5), 1075–1099 (2020). https://doi.org/10.1007/s00778-020-00606-9

    Article  Google Scholar 

  23. Meng, L., Yuan, L., Chen,Z., Lin, X., Yang, S.: Index-based structural clustering on directed graphs. In: Proceedings of ICDE, pp. 2831–2844 (2022)

    Google Scholar 

  24. Misra, J., Gries, D.: A constructive proof of vizing’s theorem. In: Information Processing Letters (1992)

    Google Scholar 

  25. Nemhauser, G.L., Park, S.: A polyhedral approach to edge coloring. Oper. Res. Lett. 10(6), 315–322 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  26. Ohsaka, N., Maehara, T., Kawarabayashi, K.: Efficient pagerank tracking in evolving networks. In: Proceedings of SIGKDD, pp. 875–884 (2015)

    Google Scholar 

  27. Ramalingam, G., Reps, T.W.: On the computational complexity of dynamic graph problems. Theor. Comput. Sci. 158(1 &2), 233–277 (1996)

    Google Scholar 

  28. Saberi, A., Wajc, D.: The greedy algorithm is not optimal for on-line edge coloring. In: Proceedings of ICALP, pp. 109:1–109:18 (2021)

    Google Scholar 

  29. Sameh, A.: A twitter analytic tool to measure opinion, influence and trust. J. Ind. Intell. Inf. 1(1), 37–45 (2013)

    Google Scholar 

  30. Sanders, P., Steurer, D.: An asymptotic approximation scheme for multigraph edge coloring. In: Proceedings of SODA, pp. 897–906 (2005)

    Google Scholar 

  31. Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Discret. Analiz 3, 25–30 (1964)

    MathSciNet  Google Scholar 

  32. Yang, B., Sato, I., Nakagawa, H.: Privacy-preserving EM algorithm for clustering on social network. In: Proceedings of PAKDD, pp. 542–553 (2012)

    Google Scholar 

  33. Long Yuan, L., Qin, X.L., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171–196 (2016)

    Article  Google Scholar 

  34. Long Yuan, L., Qin, X.L., Chang, L., Zhang, W.: Effective and efficient dynamic graph coloring. Proc. VLDB Endow. 11(3), 338–351 (2017)

    Article  Google Scholar 

  35. Long Yuan, L., Qin, W.Z., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922–935 (2018)

    Article  Google Scholar 

  36. Zhang, J., Li, W., Yuan, L., Qin, L., Zhang, Y., Chang, L.: Shortest-path queries on complex networks: experiments, analyses, and improvement. Proc. VLDB Endow. 15(11), 2640–2652 (2022)

    Article  Google Scholar 

  37. Zhang, J., Yuan, L., Li, W., Qin, L., Zhang, Y.: Efficient label-constrained shortest path queries on road networks: a tree decomposition approach. Proc. VLDB Endow. 15(3), 686–698 (2021)

    Google Scholar 

  38. Zhou, X., Nakano, S.-I., Nishizeki, T.: Edge-coloring partial k-trees. J. Algorithms 21(3), 598–617 (1996)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

Long Yuan is supported by National Key RD Program of China 2022YFF0712100, NSFC61902184, and Science and Technology on Information Systems Engineering Laboratory WDZC20205250411. Zi Chen is supported by CPSF 2021M701214. Shiyu Yang is supported by NSFC61802127, Guangzhou Research Foundation 202201020131 and CCF-Ant Research Fund.

Author information

Authors and Affiliations

  1. Nanjing University of Science and Technology, Nanjing, China

    Zhepeng Huang, Long Yuan & Haofei Sui

  2. East China Normal University, Shanghai, China

    Zi Chen

  3. Guangzhou University, Guangzhou, China

    Shiyu Yang & Jianye Yang

Authors
  1. Zhepeng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Long Yuan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haofei Sui
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shiyu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jianye Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Long Yuan .

Editor information

Editors and Affiliations

  1. Tianjin University, Tianjin, China

    Xin Wang

  2. University of Torino, Turin, Italy

    Maria Luisa Sapino

  3. POSTECH, Pohang, Korea (Republic of)

    Wook-Shin Han

  4. University of California Santa Barbara, Santa Barbara, CA, USA

    Amr El Abbadi

  5. University of Auckland, Auckland, New Zealand

    Gill Dobbie

  6. Tianjin University, Tianjin, China

    Zhiyong Feng

  7. Beijing University of Posts and Telecommunications, Beijing, China

    Yingxiao Shao

  8. The University of Queensland, Brisbane, QLD, Australia

    Hongzhi Yin

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Huang, Z., Yuan, L., Sui, H., Chen, Z., Yang, S., Yang, J. (2023). Edge Coloring on Dynamic Graphs. In: Wang, X., et al. Database Systems for Advanced Applications. DASFAA 2023. Lecture Notes in Computer Science, vol 13945. Springer, Cham. https://doi.org/10.1007/978-3-031-30675-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-30675-4_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-30674-7

  • Online ISBN: 978-3-031-30675-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics