Irredundant algorithms for traversing directed graphs: the nondeterministic case

DOI10.1023/B:PACS.0000013436.72070.95MaRDI QIDQ557536zbMATH OpenOpenAlexFDO

Authors Jianyong Qiao, Sumit K. Garg

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited in

(1)

• Projecting transition systems: overcoming state explosion in concurrent system verification

This page was built for publication: Irredundant algorithms for traversing directed graphs: the nondeterministic case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557536)