Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375)

From MaRDI portal
Revision as of 16:53, 20 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
scientific article

    Statements

    title
    Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (English)
    0 references
    publication date
    26 August 2013
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q360375&oldid=422433"
      Powered by MediaWiki