Pruning 2-connected graphs (Q2428662)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Pruning 2-connected graphs
scientific article

    Statements

    title
    Pruning 2-connected graphs (English)
    0 references
    author
    Chandra Chekuri
    0 references
    Nitish Korula
    0 references
    published in
    Algorithmica
    0 references
    publication date
    26 April 2012
    0 references
    zbMATH Keywords
    2-connected graphs
    0 references
    approximation
    0 references
    \(k\)-MST
    0 references
    prize-collecting trees
    0 references
    density
    0 references
    cites work
    Q3056948
    0 references
    Q3579405
    0 references
    Q3579451
    0 references
    Q3002852
    0 references
    Q3549695
    0 references
    Saving an epsilon
    0 references
    Q4952698
    0 references
    Nowhere-zero 6-flows
    0 references
    Q4782696
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    68Q17
    0 references
    05C40
    0 references
    68R10
    0 references
    zbMATH DE Number
    6028418
    0 references
    OpenAlex ID
    W2140192095
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2428662&oldid=35274960"
    Powered by MediaWiki