The Shortest-Path Distance and Count Ranking Problem: Evaluating Vertex Importance by Combining Efficiency and Robustness

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: The Shortest-Path Distance and Count Ranking Problem: Evaluating Vertex Importance by Combining Efficiency and Robustness
Συγγραφείς: Chen, Jiaxing, Ouyang, Dian
Πηγή: 2025 International Conference on Big Data and Data Mining (BDDM) Big Data and Data Mining (BDDM), 2025 International Conference on. :1-5 Dec, 2025
Relation: 2025 International Conference on Big Data and Data Mining (BDDM)
Βάση Δεδομένων: IEEE Xplore Digital Library
Περιγραφή
ISBN:9798331577537
9798331577544
DOI:10.1109/BDDM68348.2025.11442129