On the complexity of reconstructing H-free graphs from their Star Systems (Q3174240)

From MaRDI portal
Revision as of 01:48, 16 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q60488573, #quickstatements; #temporary_batch_1708039819900)
scientific article
Language Label Description Also known as
English
On the complexity of reconstructing H-free graphs from their Star Systems
scientific article

    Statements

    title
    On the complexity of reconstructing H-free graphs from their Star Systems (English)
    0 references
    DOI
    10.1002/jgt.20544
    0 references
    author
    Fedor V. Fomin
    0 references
    Jan Kratochvíl
    0 references
    Daniel Lokshtanov
    0 references
    Federico Mancini
    0 references
    Jan Arne Telle
    0 references
    publication date
    12 October 2011
    0 references
    zbMATH DE Number
    5957650
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    Wikidata QID
    Q60488573
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3174240&oldid=21461943"
    Powered by MediaWiki