Expected complexity of graph partitioning problems (Q1346695)

From MaRDI portal
Revision as of 01:33, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dam/Kucera95, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
Expected complexity of graph partitioning problems
scientific article

    Statements

    title
    Expected complexity of graph partitioning problems (English)
    0 references
    publication date
    10 April 1995
    0 references
    zbMATH Keywords
    time complexity
    0 references
    graph partitioning problems
    0 references
    author
    Luděk Kučera
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    68Q25
    0 references
    05C15
    0 references
    05C80
    0 references
    60C05
    0 references
    zbMATH DE Number
    741474
    0 references
    Wikidata QID
    Q57568010
    0 references
    OpenAlex ID
    W2062307640
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1346695&oldid=37911771"
    Powered by MediaWiki