Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case. Bourdonov, I. B., Kossatchev, A. S., & Kuliamin, V. V. Programming and Computer Software, 30(1):2-17, 2004.
Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case. [link]Link  Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case. [link]Paper  bibtex   
@article{journals/pcs/BourdonovKK04,
  added-at = {2015-11-16T00:00:00.000+0100},
  author = {Bourdonov, Igor B. and Kossatchev, Alexander S. and Kuliamin, Victor V.},
  biburl = {http://www.bibsonomy.org/bibtex/29815bd47d0769ab9dcca72585faa52cc/dblp},
  ee = {http://dx.doi.org/10.1023/B:PACS.0000013436.72070.95},
  interhash = {761455b2cff379783a6521782fe06c56},
  intrahash = {9815bd47d0769ab9dcca72585faa52cc},
  journal = {Programming and Computer Software},
  keywords = {dblp},
  number = 1,
  pages = {2-17},
  timestamp = {2015-11-17T11:35:53.000+0100},
  title = {Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case.},
  url = {http://dblp.uni-trier.de/db/journals/pcs/pcs30.html#BourdonovKK04},
  volume = 30,
  year = 2004
}

Downloads: 0