How the result of graph clustering methods depends on the construction of the graph (Q5408477): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1051/ps/2012001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2133896597 / rank | |||
Normal rank | |||
Latest revision as of 21:41, 19 March 2024
scientific article; zbMATH DE number 6282478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How the result of graph clustering methods depends on the construction of the graph |
scientific article; zbMATH DE number 6282478 |
Statements
How the result of graph clustering methods depends on the construction of the graph (English)
0 references
10 April 2014
0 references
random geometric graphs
0 references
graph cuts
0 references
