Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472)

From MaRDI portal
Revision as of 11:55, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallel Maximum Clique Algorithms with Applications to Network Analysis
scientific article

    Statements

    title
    Parallel Maximum Clique Algorithms with Applications to Network Analysis (English)
    0 references
    author
    Ryan Anthony Rossi
    0 references
    David F. Gleich
    0 references
    publication date
    27 October 2015
    0 references
    zbMATH Keywords
    parallel maximum clique algorithms
    0 references
    branch-and-bound
    0 references
    network analysis
    0 references
    temporal strong components
    0 references
    graph compression
    0 references
    describes a project that uses
    MaxCliqueDyn
    0 references
    igraph
    0 references
    IsoRank
    0 references
    UbiCrawler
    0 references
    DIMACS
    0 references
    Algorithm 457
    0 references
    WebGraph
    0 references
    cites work
    Q3145799
    0 references
    Q2753729
    0 references
    Q2837833
    0 references
    Q3128918
    0 references
    Q5687246
    0 references

    Identifiers

    DOI
    10.1137/14100018X
    0 references
    Mathematics Subject Classification ID
    05C69
    0 references
    05C82
    0 references
    05C85
    0 references
    05C90
    0 references
    90C27
    0 references
    zbMATH DE Number
    6499028
    0 references
    OpenAlex ID
    W1823437338
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3447472&oldid=37370896"
    Powered by MediaWiki