Towards a characterization of order-invariant queries over tame graphs (Q3616348)
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: Towards a characterization of order-invariant queries over tame graphs |
scientific article; zbMATH DE number 5532615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a characterization of order-invariant queries over tame graphs |
scientific article; zbMATH DE number 5532615 |
Statements
Towards a characterization of order-invariant queries over tame graphs (English)
0 references
25 March 2009
0 references
finite model theory
0 references
expressive power of logics on finite graphs
0 references
Gaifman graph
0 references
definability
0 references
collapse
0 references
0 references
0.9829087257385254
0 references
0.8549407720565796
0 references
0.8341677784919739
0 references
0.8015984892845154
0 references
0.7895718812942505
0 references
