On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000)

From MaRDI portal
Revision as of 00:28, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7333772
Language Label Description Also known as
English
On solving the densest<i>k</i>-subgraph problem on large graphs
scientific article; zbMATH DE number 7333772

    Statements

    On solving the densest<i>k</i>-subgraph problem on large graphs (English)
    0 references
    0 references
    15 April 2021
    0 references
    densest \(k\)-subgraph problem
    0 references
    random coordinate descent algorithm
    0 references
    large graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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