A linear-time algorithm to find a separator in a graph excluding a minor (Q2930265)

From MaRDI portal
Revision as of 01:21, 28 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56235112, #quickstatements; #temporary_batch_1711574657256)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A linear-time algorithm to find a separator in a graph excluding a minor
scientific article

    Statements

    title
    A linear-time algorithm to find a separator in a graph excluding a minor (English)
    0 references
    author
    David R. Wood
    0 references
    Bruce A. Reed
    0 references
    publication date
    18 November 2014
    0 references
    zbMATH Keywords
    minor graphs
    0 references
    separator
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C69
    0 references
    05C83
    0 references
    05C90
    0 references
    68Q17
    0 references
    68W25
    0 references
    zbMATH DE Number
    6370604
    0 references
    OpenAlex ID
    W2030012922
    0 references
    Wikidata QID
    Q56235112
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2930265&oldid=33220405"
    Powered by MediaWiki