|
|||||
|
|
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs |
|
| Authors: | Ding Wei Qiu Ke Zhou Yu Ye Zhou |
| Institution: | 1.Zhejiang University of Water Resources and Electric Power, Hangzhou, 310018, Zhejiang, China ;2.Department of Computer Science, Brock University, St. Catharines, Canada ;3.College of Data Science, Taiyuan University of Technology, Taiyuan, 030024, Shanxi Province, China ;4.Zhejiang Ocean University, Zhoushan, 316022, Zhejiang Province, China ; |
| Abstract: | Journal of Combinatorial Optimization - Let $$G = (V, E, w)$$ be an undirected connected edge-weighted graph, where V is the n-vertices set, E is the m-edges set, and $$w: E \rightarrow \mathbb... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |