Dominating sets of random recursive trees (Q3439556): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2006.08.078 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045622282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Emergence of Scaling in Random Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear algorithm for the domination number of a tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4940321 / rank | |||
Normal rank | |||
Latest revision as of 20:11, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dominating sets of random recursive trees |
scientific article |
Statements
Dominating sets of random recursive trees (English)
0 references
29 May 2007
0 references
random trees
0 references
dominating sets
0 references
algorithms
0 references
