Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm (Q5458503): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-77294-1_4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2162824303 / rank | |||
Normal rank | |||
Revision as of 20:44, 19 March 2024
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
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
