A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139)

From MaRDI portal
Revision as of 23:17, 26 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1213750
Language Label Description Also known as
English
A Better Approximation Algorithm for Finding Planar Subgraphs
scientific article; zbMATH DE number 1213750

    Statements

    title
    A Better Approximation Algorithm for Finding Planar Subgraphs (English)
    0 references
    author
    Gruia Călinescu
    0 references
    Cristina G. Fernandes
    0 references
    Ulrich Finkler
    0 references
    Howard J. Karloff
    0 references
    publication date
    1998
    0 references
    zbMATH Keywords
    maximum planar subgraph problem
    0 references

    Identifiers

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