Time-space tradeoffs for undirected graph traversal by graph automata (Q675049)
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: Time-space tradeoffs for undirected graph traversal by graph automata |
scientific article; zbMATH DE number 987863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space tradeoffs for undirected graph traversal by graph automata |
scientific article; zbMATH DE number 987863 |
Statements
Time-space tradeoffs for undirected graph traversal by graph automata (English)
0 references
13 October 1997
0 references
undirected graph problems
0 references
0.8258992433547974
0 references
0.8060460090637207
0 references
0.781810998916626
0 references
