Irredundant algorithms for traversing directed graphs: the nondeterministic case
From MaRDI portal
Publication:557536
DOI10.1023/B:PACS.0000013436.72070.95zbMath1124.68399OpenAlexW1992286012MaRDI QIDQ557536
Publication date: 30 June 2005
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:pacs.0000013436.72070.95
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
This page was built for publication: Irredundant algorithms for traversing directed graphs: the nondeterministic case
