Fast maximal cliques enumeration in sparse graphs (Q1949748)

From MaRDI portal
Revision as of 05:20, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Fast maximal cliques enumeration in sparse graphs
scientific article

    Statements

    title
    Fast maximal cliques enumeration in sparse graphs (English)
    0 references
    author
    Lijun Chang
    0 references
    Jeffrey Xu Yu
    0 references
    Lu Qin
    0 references
    published in
    Algorithmica
    0 references
    publication date
    16 May 2013
    0 references
    zbMATH Keywords
    maximal clique
    0 references
    polynomial delay
    0 references
    sparse graph
    0 references
    \(H\)-partition
    0 references
    \(H\)-value
    0 references

    Identifiers

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