Pages that link to "Item:Q672455"
From MaRDI portal
The following pages link to The minimum broadcast time problem for several processor networks (Q672455):
Displaying 12 items.
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
- Finding a minimum medial axis of a discrete shape is NP-hard (Q952462) (← links)
- Minimum-time multidrop broadcast (Q1392528) (← links)
- The multiple originator broadcasting problem in graphs (Q2370417) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- Minimization of the total completion time for asynchronous transmission in a packet data-transmission system (Q3587069) (← links)
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)
- Approximation algorithms in graphs with known broadcast time of the base graph (Q6102286) (← links)
- Tighter bounds on the minimum broadcast time (Q6122083) (← links)
- Shortest longest-path graph orientations (Q6591464) (← links)
- Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)