An algorithm for finding a large independent set in planar graphs (Q4745274)

From MaRDI portal
Revision as of 18:18, 9 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3800941
Language Label Description Also known as
English
An algorithm for finding a large independent set in planar graphs
scientific article; zbMATH DE number 3800941

    Statements

    title
    An algorithm for finding a large independent set in planar graphs (English)
    0 references
    author
    Norishige Chiba
    0 references
    Takao Nishizeki
    0 references
    Nobuji Saito
    0 references
    published in
    Networks
    0 references
    publication date
    1983
    0 references

    Identifiers

    zbMATH DE Number
    3800941
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4745274&oldid=9210087"
      Powered by MediaWiki