Pages that link to "Item:Q685502"
From MaRDI portal
The following pages link to Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502):
Displaying 16 items.
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q1392535) (← links)
- Broadcasting a file in a communication network (Q2173055) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- (Q3474496) (← links)
- Degree- and time-constrained broadcast networks (Q4537618) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5918792) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5919106) (← links)
- Approximation algorithms in graphs with known broadcast time of the base graph (Q6102286) (← links)
- Tighter bounds on the minimum broadcast time (Q6122083) (← links)
- The complexity of broadcasting in planar and decomposable graphs (Q6184371) (← links)
- A note to non-adaptive broadcasting (Q6536205) (← links)
- Improved approximation for broadcasting in k-path graphs (Q6606222) (← links)
- Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)
- A linear-time optimal broadcasting algorithm in stars of cliques (Q6636986) (← links)
