Partitioning graphs into connected parts (Q1034603)

From MaRDI portal
Revision as of 03:59, 2 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
Partitioning graphs into connected parts
scientific article

    Statements

    title
    Partitioning graphs into connected parts (English)
    0 references
    author
    Pim van 't Hof
    0 references
    Daniël Paulusma
    0 references
    Gerhard J. Woeginger
    0 references
    publication date
    6 November 2009
    0 references
    zbMATH Keywords
    graph partition
    0 references
    edge contraction
    0 references
    path
    0 references
    exact algorithm
    0 references

    Identifiers

    zbMATH DE Number
    5626954
    0 references
    OpenAlex ID
    W4213168420
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1034603&oldid=35136016"
    Powered by MediaWiki