A fast retrieval technique for large graph structures (Q2710761): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948568 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3136414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Compressed tries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for dynamic processing of dawg's / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Storing a sparse table / rank | |||
Normal rank |
Latest revision as of 16:44, 3 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast retrieval technique for large graph structures |
scientific article |
Statements
A fast retrieval technique for large graph structures (English)
0 references
19 December 2002
0 references
graph structures
0 references
worst-case time complexity
0 references
storing and retrieving
0 references
data compressing
0 references
finite automata
0 references