On independent sets and bicliques in graphs (Q2428684)

From MaRDI portal
Revision as of 03:37, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On independent sets and bicliques in graphs
scientific article

    Statements

    title
    On independent sets and bicliques in graphs (English)
    0 references
    author
    Serge Gaspers
    0 references
    Dieter Kratsch
    0 references
    Mathieu Liedloff
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 April 2012
    0 references
    zbMATH Keywords
    counting algorithms
    0 references
    combinatorial bound
    0 references
    maximal bicliques
    0 references
    maximal independent sets
    0 references
    exact exponential time algorithm
    0 references
    cites work
    Q3044360
    0 references
    Q4828946
    0 references
    Q4877294
    0 references
    Q4198056
    0 references
    Q5403013
    0 references
    On cliques in graphs
    0 references
    Q4910758
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C35
    0 references
    05C69
    0 references
    05C85
    0 references
    05C30
    0 references
    zbMATH DE Number
    6028439
    0 references
    OpenAlex ID
    W2134046427
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2428684&oldid=35274981"
    Powered by MediaWiki