A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (Q4719338)

From MaRDI portal
Revision as of 00:48, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1383714
Language Label Description Also known as
English
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
scientific article; zbMATH DE number 1383714

    Statements

    title
    A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph (English)
    0 references
    author
    Yefim Dinitz
    0 references
    Domenico Parente
    0 references
    Vincenzo Auletta
    0 references
    Zeev Nutov
    0 references
    publication date
    18 December 2000
    0 references
    zbMATH Keywords
    \(k\)-vertex connected graphs
    0 references

    Identifiers

    zbMATH DE Number
    1383714
    0 references
    OpenAlex ID
    W1984289304
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4719338&oldid=32459994"
    Powered by MediaWiki