Irredundant algorithms for traversing directed graphs: the nondeterministic case (Q557536)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Irredundant algorithms for traversing directed graphs: the nondeterministic case |
scientific article; zbMATH DE number 2183792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Irredundant algorithms for traversing directed graphs: the nondeterministic case |
scientific article; zbMATH DE number 2183792 |
Statements
Irredundant algorithms for traversing directed graphs: the nondeterministic case (English)
0 references
30 June 2005
0 references
