Raikwar, H., & Karmakar, S. (2022, November). Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs. International Symposium on Computing and Networking Workshops (Online), 416-420. https://doi.org/10.1109/CANDARW57323.2022.00064
Chicago-Zitierstil (17. Ausg.)Raikwar, Hemraj, und Sushanta Karmakar. "Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs." International Symposium on Computing and Networking Workshops (Online) Nov. 2022: 416-420. https://doi.org/10.1109/CANDARW57323.2022.00064.
MLA-Zitierstil (9. Ausg.)Raikwar, Hemraj, und Sushanta Karmakar. "Fully Dynamic Algorithm for the Steiner Tree Problem in Planar Graphs." International Symposium on Computing and Networking Workshops (Online), Nov. 2022, pp. 416-420, https://doi.org/10.1109/CANDARW57323.2022.00064.