APA (7th ed.) Citation

Chen, J., & Ouyang, D. (2025). The Shortest-Path Distance and Count Ranking Problem: Evaluating Vertex Importance by Combining Efficiency and Robustness. 2025 International Conference on Big Data and Data Mining (BDDM), Big Data and Data Mining (BDDM), 2025 International Conference on, 1. https://doi.org/10.1109/BDDM68348.2025.11442129

Chicago Style (17th ed.) Citation

Chen, Jiaxing, and Dian Ouyang. "The Shortest-Path Distance and Count Ranking Problem: Evaluating Vertex Importance by Combining Efficiency and Robustness." 2025 International Conference on Big Data and Data Mining (BDDM), Big Data and Data Mining (BDDM), 2025 International Conference on 2025: 1. https://doi.org/10.1109/BDDM68348.2025.11442129.

MLA (9th ed.) Citation

Chen, Jiaxing, and Dian Ouyang. "The Shortest-Path Distance and Count Ranking Problem: Evaluating Vertex Importance by Combining Efficiency and Robustness." 2025 International Conference on Big Data and Data Mining (BDDM), Big Data and Data Mining (BDDM), 2025 International Conference on, 2025, p. 1, https://doi.org/10.1109/BDDM68348.2025.11442129.