Hearing the clusters of a graph: A distributed algorithm (Q445023): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 93A15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 93A14 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6071668 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
decentralized systems | |||
| Property / zbMATH Keywords: decentralized systems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
graph theory | |||
| Property / zbMATH Keywords: graph theory / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
decomposition methods | |||
| Property / zbMATH Keywords: decomposition methods / rank | |||
Normal rank | |||
Revision as of 01:56, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hearing the clusters of a graph: A distributed algorithm |
scientific article |
Statements
Hearing the clusters of a graph: A distributed algorithm (English)
0 references
24 August 2012
0 references
decentralized systems
0 references
graph theory
0 references
decomposition methods
0 references
