[Springer] Novel Algorithms for Extracting Minimal Path Sets in K-Terminal Networks: Case of GARR.

emad2025-23 Post time The day before yesterday 03:44 | Show all posts |Read mode

This post will be closed automatically in 2026-08-14 03:41

Reward30points

Howeidi, H.S., Hassan, Z.A.H. (2027). Novel Algorithms for Extracting Minimal Path Sets in K-Terminal Networks: Case of GARR. In: Saraswat, M., Tiwari, R., Pavone, M.F., Patel, S.J. (eds) Proceedings of International Conference on Computational Intelligence. ICCI 2025. Lecture Notes in Networks and Systems, vol 2063. Springer, Cham. https://doi.org/10.1007/978-3-032-31523-6_33

https://doi.org/10.1007/978-3-032-31523-6_33

Download citation

DOIhttps://doi.org/10.1007/978-3-032-31523-6_33
Published02 August 2026
Publisher NameSpringer, Cham
Print ISBN978-3-032-31522-9
Online ISBN978-3-032-31523-6
eBook PackagesIntelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)Springer Nature Proceedings excluding Computer Science

You can support us by donating, we would be very grateful.

Reply

Use magic Donate Report

All Reply0 Show all posts

Reply

emad2025-23 Lv.2

Junior Member

post
reply
points
75

[Springer] Novel Algorithms for Extracting Minimal Path Sets in K-Terminal Networks: Case of GARR.

Reply

Same Category

Latest Reply

Announcement

Daily Top Contributors

[Springer] Novel Algorithms for Extracting Minimal Path Sets in K-Terminal Networks: Case of GARR. Copy

Reply

Same Category

Latest Reply

Announcement

Daily Top Contributors

[Springer] Novel Algorithms for Extracting Minimal Path Sets in K-Terminal Networks: Case of GARR.