Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679)
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: Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs |
scientific article; zbMATH DE number 6509830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs |
scientific article; zbMATH DE number 6509830 |
Statements
Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (English)
0 references
17 November 2015
0 references
graphs algorithms
0 references
graph indexing
0 references
shortest path
0 references
tree decomposition
0 references
\(k\)-nearest neighbors problems
0 references
0.9047856
0 references
0.8593488
0 references
0.85818493
0 references
0.85403514
0 references
0.85299546
0 references
0.8497757
0 references
