"Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case."

Igor B. Bourdonov, Alexander S. Kossatchev, Victor V. Kuliamin (2003)

> Home

Details and statistics

DOI: 10.1023/A:1025733107700

access: closed

type: Journal Article

metadata version: 2020-09-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pcs/BourdonovKK03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pcs/BourdonovKK03
Igor B. Bourdonov, Alexander S. Kossatchev, Victor V. Kuliamin:
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case. Program. Comput. Softw. 29(5): 245-258 (2003)

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.