Clustering for metric graphs using the \(p\)-Laplacian (Q333250)

From MaRDI portal
Revision as of 14:35, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    28 October 2016
    0 references
    clustering problem in a metric graph
    0 references
    quantum graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references