"An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs."

Mehmet Hakan Karaata (2019)

> Home

Details and statistics

DOI: 10.20532/CIT.2019.1004754

access: closed

type: Journal Article

metadata version: 2022-06-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cit/Karaata19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cit/Karaata19
Mehmet Hakan Karaata:
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs. J. Comput. Inf. Technol. 27(3): 1-14 (2019)

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.