Pages that link to "Item:Q1871774"
From MaRDI portal
The following pages link to Polynomial-time algorithms for minimum-time broadcast in trees (Q1871774):
Displaying 8 items.
- The shared broadcast tree problem and MST (Q510900) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- On the complexity of some arborescences finding problems on a multishop radio network (Q1123615) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)