Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (Q5458503)

From MaRDI portal
Revision as of 11:48, 9 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 5263881
Language Label Description Also known as
English
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
scientific article; zbMATH DE number 5263881

    Statements

    Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    cleaning process
    0 references
    random d-regular graphs
    0 references
    degree-greedy algorithm
    0 references
    differential equations method
    0 references

    Identifiers