On making directed graphs transitive (Q414917)

From MaRDI portal
Revision as of 05:16, 5 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
On making directed graphs transitive
scientific article

    Statements

    title
    On making directed graphs transitive (English)
    0 references
    author
    Mathias Weller
    0 references
    Christian Komusiewicz
    0 references
    Rolf Niedermeier
    0 references
    Johannes Uhlmann
    0 references
    publication date
    11 May 2012
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C20
    0 references
    05C85
    0 references
    05C90
    0 references
    zbMATH DE Number
    6033510
    0 references
    zbMATH Keywords
    graph modification problem
    0 references
    NP-hardness
    0 references
    hierarchical structure detection
    0 references
    fixed-parameter tractability
    0 references
    kernelization and data reduction
    0 references
    OpenAlex ID
    W1968950817
    0 references
    cites work
    Digraphs
    0 references
    Q4393480
    0 references
    Q5710169
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q414917&oldid=35277815"
    Powered by MediaWiki