Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (Q5855211): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3046714641 / rank | |||
Normal rank | |||
Latest revision as of 20:50, 19 March 2024
scientific article; zbMATH DE number 7323174
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems |
scientific article; zbMATH DE number 7323174 |
Statements
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems (English)
0 references
15 March 2021
0 references
LCL
0 references
LOCAL model
0 references
hierarchy
0 references
locally checkable labeling
0 references
query complexity
0 references
volume complexity
0 references
