Aminian, A., Kamali, S., Seyed-Javadi, S., & Sumedha. (2025). On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs.
Cita Chicago Style (17a ed.)Aminian, Aida, Shahin Kamali, Seyed-Mohammad Seyed-Javadi, y Sumedha. On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs. 2025.
Cita MLA (9a ed.)Aminian, Aida, et al. On the Complexity of Telephone Broadcasting: From Cacti to Bounded Pathwidth Graphs. 2025.
Precaución: Estas citas no son 100% exactas.