Shortest node-to-node disjoint paths algorithm for symmetric networks
Crossref DOI link: https://doi.org/10.1007/s10586-024-04582-5
Published Online: 2024-06-15
Published Print: 2024-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
AlMansouri, Hesham
Hussain, Zaid
Text and Data Mining valid from 2024-06-15
Version of Record valid from 2024-06-15
Article History
Received: 7 March 2024
Revised: 26 April 2024
Accepted: 17 May 2024
First Online: 15 June 2024
Declarations
:
: The authors have not disclosed any competing interests.