A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem |
scientific article; zbMATH DE number 5300651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem |
scientific article; zbMATH DE number 5300651 |
Statements
A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (English)
0 references
11 July 2008
0 references
algorithm
0 references
spanning tree
0 references
directed acyclic graph
0 references
minimum time broadcast
0 references
0 references
