Fast searching on Cartesian products of graphs (Q2988858)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6721552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast searching on Cartesian products of graphs |
scientific article; zbMATH DE number 6721552 |
Statements
Fast Searching on Cartesian Products of Graphs (English)
0 references
19 May 2017
0 references
fast searching problem
0 references
Cartesian product of an Eulerian graph and a path
0 references
0.9921518564224244
0 references
0.8440905809402466
0 references
0.843987762928009
0 references
0.8249796628952026
0 references
0.8129319548606873
0 references
