Irredundant algorithms for traversing directed graphs: the nondeterministic case (Q557536)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Irredundant algorithms for traversing directed graphs: the nondeterministic case |
scientific article |
Statements
Irredundant algorithms for traversing directed graphs: the nondeterministic case (English)
0 references
30 June 2005
0 references
