Boolean-width of graphs (Q719257)

From MaRDI portal
Revision as of 08:32, 4 January 2025 by Import241231041249 (talk | contribs) (Add wikidata reference.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Boolean-width of graphs
scientific article

    Statements

    title
    Boolean-width of graphs (English)
    0 references
    author
    Binh-Minh Bui-Xuan
    0 references
    Jan Arne Telle
    0 references
    Martin Vatshelle
    0 references
    publication date
    10 October 2011
    0 references
    zbMATH Keywords
    graph decomposition
    0 references
    FPT algorithm
    0 references
    width parameter
    0 references
    Boolean algebra
    0 references
    cites work
    Q2784326
    0 references
    Q4938660
    0 references
    Q4503944
    0 references
    Q5592270
    0 references
    Q4489221
    0 references
    Q3958592
    0 references
    Q4352948
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C12
    0 references
    05C85
    0 references
    zbMATH DE Number
    5955879
    0 references
    OpenAlex ID
    W2154682992
    0 references
    Wikidata QID
    Q131629058
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q719257&oldid=39802894"
    Powered by MediaWiki