Path logics for querying graphs: combining expressiveness and efficiency (Q4635815)
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 6863400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Path logics for querying graphs: combining expressiveness and efficiency |
scientific article; zbMATH DE number 6863400 |
Statements
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (English)
0 references
23 April 2018
0 references
0.7912769913673401
0 references
0.7876423597335815
0 references
0.7712687253952026
0 references
0.7697243094444275
0 references
0.7679231762886047
0 references
