Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581)

From MaRDI portal
Revision as of 01:03, 11 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
Efficiently enumerating all maximal cliques with bit-parallelism
scientific article

    Statements

    title
    Efficiently enumerating all maximal cliques with bit-parallelism (English)
    0 references
    author
    Pablo San Segundo
    0 references
    Jorge Artieda
    0 references
    Darren Strash
    0 references
    publication date
    12 July 2018
    0 references
    zbMATH Keywords
    maximal clique
    0 references
    bitstring
    0 references
    branch-and-bound
    0 references
    subgraph enumeration
    0 references
    combinatorial optimization
    0 references
    describes a project that uses
    GitHub
    0 references
    DIMACS
    0 references
    BHOSLIB
    0 references
    Algorithm 457
    0 references
    cites work
    Q4598291
    0 references
    Q4714131
    0 references
    On cliques in graphs
    0 references
    Q4452109
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C30
    0 references
    05C69
    0 references
    05C85
    0 references
    90C27
    0 references
    90C35
    0 references
    zbMATH DE Number
    6902786
    0 references
    OpenAlex ID
    W2775591332
    0 references
    arXiv ID
    1801.00202
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1651581&oldid=38682528"
    Powered by MediaWiki