Efficient eigenvalue counts for tree-like networks (Q5881465): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/comnet/cnac040 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4292714555 / rank | |||
Normal rank | |||
Latest revision as of 20:17, 19 March 2024
scientific article; zbMATH DE number 7661964
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient eigenvalue counts for tree-like networks |
scientific article; zbMATH DE number 7661964 |
Statements
Efficient eigenvalue counts for tree-like networks (English)
0 references
10 March 2023
0 references
eigenvalue count
0 references
message-passing
0 references
locally tree-like
0 references
random networks
0 references
