A new class of distances for graph vertices is proposed. This class contains parametric families of distances which reduce to the shortest-path, weighted shortest-path, and the resistance distances at the limiting values of the family parameters. The main property of the class is that all distances it comprises are graph-geodetic: $d(i,j)+d(j,k)=d(i,k)$ if and only if every path from $i$ to $k$ passes through $j$. The construction of the class is based on the matrix forest theorem and the transition inequality.
The Closed Geodetic Game: algorithms and strategies
Université Clermont Auvergne(克莱蒙奥弗涅大学);CNRS(法国国家科学研究中心);Mines de Saint-Étienne(圣艾蒂安国立高等矿业学校);Clermont-Auvergne-INP(克莱蒙奥弗涅理工学院);LIMOS(极限与优化实验室);INRAE(法国国家农业、食品和环境研究所);Laboratoire G-SCOP(G-SCOP实验室);CNRS, Univ. Grenoble Alpes(法国国家科学研究中心,格勒诺布尔阿尔卑斯大学);Ben-Gurion University of the Negev(内盖夫本古里安大学);Indian Institute of Technology Dharwad(印度理工学院达瓦德分校);Polytechnic University (Kyaing Tong)(桂开工科大学)
College of Saint Benedict and Saint John’s University(圣本笃学院和圣约翰大学);Northern Arizona University(北亚利桑那大学);University of South Florida(南佛罗里达大学);University of Colorado Boulder(科罗拉多大学博尔德分校)
College of Saint Benedict and Saint John’s University(圣本笃学院与圣约翰大学);Northern Arizona University(北亚利桑那大学);Lewis University(路易斯大学);University of Colorado Boulder(科罗拉多大学博尔德分校)
Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
CNRS, ENS de Lyon, Université Claude Bernard Lyon 1(法国国家科学研究中心、里昂高等师范学院、里昂第一大学);Discrete Mathematics Group, Institute for Basic Science (IBS)(基础科学研究院离散数学组);School of Computing, KAIST(韩国科学技术院计算机学院)
Slovak University of Technology(斯洛伐克技术大学);University of Split(斯普利特大学);Faculty of Information Studies, Novo Mesto(诺沃梅斯托信息研究学院);University of Ljubljana(卢布尔雅那大学);Rudolfovo - Science and Technology Centre(鲁多尔福夫科学与技术中心);Shanghai Jiao Tong University(上海交通大学)