Time-space tradeoffs for undirected graph traversal by graph automata (Q675049): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: P. W. Beame / rank | |||
| Property / author | |||
| Property / author: P. W. Beame / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57904581 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982053238 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:20, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time-space tradeoffs for undirected graph traversal by graph automata |
scientific article |
Statements
Time-space tradeoffs for undirected graph traversal by graph automata (English)
0 references
13 October 1997
0 references
undirected graph problems
0 references
