Clustering for metric graphs using the \(p\)-Laplacian (Q333250): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1307/MMJ/1472066142 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1307/MMJ/1472066142 / rank | |||
Normal rank | |||
Latest revision as of 14:35, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Clustering for metric graphs using the \(p\)-Laplacian |
scientific article |
Statements
Clustering for metric graphs using the \(p\)-Laplacian (English)
0 references
28 October 2016
0 references
clustering problem in a metric graph
0 references
quantum graph
0 references
