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 6 items.
- Polynomial algorithms for open plane graph and subgraph isomorphisms (Q391207) (← links)
- Finding a minimum medial axis of a discrete shape is NP-hard (Q952462) (← 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)
- A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)
- Tighter bounds on the minimum broadcast time (Q6122083) (← links)
