An improved bit parallel exact maximum clique algorithm (Q1941191)

From MaRDI portal
Revision as of 07:24, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An improved bit parallel exact maximum clique algorithm
scientific article

    Statements

    title
    An improved bit parallel exact maximum clique algorithm (English)
    0 references
    author
    Pablo San Segundo
    0 references
    Fernando Matia
    0 references
    Diego Rodriguez-Losada
    0 references
    Miguel Hernando
    0 references
    publication date
    12 March 2013
    0 references
    zbMATH Keywords
    maximum clique
    0 references
    branch and bound
    0 references
    exact search
    0 references
    graph
    0 references

    Identifiers

    zbMATH DE Number
    6143311
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1941191&oldid=23120337"
    Powered by MediaWiki