A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044)

From MaRDI portal
scientific article; zbMATH DE number 5494785
Language Label Description Also known as
English
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
scientific article; zbMATH DE number 5494785

    Statements

    A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (English)
    0 references
    0 references
    0 references
    20 January 2009
    0 references
    approximation algorithm
    0 references
    maximum leaf
    0 references
    connected dominating set
    0 references
    cubic graph
    0 references

    Identifiers