Polynomial-time algorithms for minimum-time broadcast in trees (Q1871774): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Set OpenAlex properties. |
||
| (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.1007/s00224-002-1047-5 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977640803 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-002-1047-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1977640803 / rank | |||
Normal rank | |||
Latest revision as of 18:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for minimum-time broadcast in trees |
scientific article |
Statements
Polynomial-time algorithms for minimum-time broadcast in trees (English)
0 references
4 May 2003
0 references
merging method
0 references
