"Shortest node-to-node disjoint paths algorithm for symmetric networks."

Hesham AlMansouri, Zaid Hussain (2024)

> Home

Details and statistics

DOI: 10.1007/S10586-024-04582-5

access: closed

type: Journal Article

metadata version: 2024-08-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cluster/AlMansouriH24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cluster/AlMansouriH24
Hesham AlMansouri, Zaid Hussain:
Shortest node-to-node disjoint paths algorithm for symmetric networks. Clust. Comput. 27(4): 4347-4360 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.