Irredundant algorithms for traversing directed graphs: The deterministic case
From MaRDI portal
Publication:2487103
DOI10.1023/A:1025733107700zbMath1101.68721OpenAlexW4245497568MaRDI QIDQ2487103
Publication date: 17 August 2005
Published in: Programming and Computer Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025733107700
Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items