Computing branchwidth via efficient triangulations and blocks (Q967315)

From MaRDI portal
Revision as of 03:04, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dam/FominMT09, #quickstatements; #temporary_batch_1731462974821)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computing branchwidth via efficient triangulations and blocks
scientific article

    Statements

    title
    Computing branchwidth via efficient triangulations and blocks (English)
    0 references
    author
    Fedor V. Fomin
    0 references
    Frédéric Mazoit
    0 references
    Ioan Todinca
    0 references
    publication date
    28 April 2010
    0 references
    zbMATH Keywords
    graph
    0 references
    branchwidth
    0 references
    exponential time algorithm
    0 references
    cites work
    3-coloring in time
    0 references
    Q3619797
    0 references
    Measure and conquer
    0 references
    Q3328583
    0 references
    Q5501274
    0 references
    Q4414647
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C12
    0 references
    68R10
    0 references
    zbMATH DE Number
    5702588
    0 references
    OpenAlex ID
    W2052451108
    0 references
    Wikidata QID
    Q60488671
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q967315&oldid=37892971"
    Powered by MediaWiki