Three-fast-searchable graphs (Q2446838): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:25, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-fast-searchable graphs |
scientific article |
Statements
Three-fast-searchable graphs (English)
0 references
22 April 2014
0 references
computational complexity
0 references
fast searching
0 references
graph searching
0 references
