A Better Approximation Algorithm for Finding Planar Subgraphs (Q4216139)

From MaRDI portal
Revision as of 02:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(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 DE Number
    1213750
    0 references
    zbMATH Keywords
    maximum planar subgraph problem
    0 references
    OpenAlex ID
    W1535967299
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4216139&oldid=32720248"
    Powered by MediaWiki