Lovsz, L. Energy of convex sets, shortest paths, and resistance. Journal of Combinatorial Theory A, 94, 363-382, 2001. :Laszlo Lovasz. Energy of convex sets, shortest paths and resistance. Journal of Combinatorial Theory, Series A, 94:363-3832, 2001....
Energy of Convex Sets, Shortest Paths, and Resistance Let us assign independent, exponentially distributed random edge lengths to the edges of an undirected graph. Lyons, Pemantle, and Peres (1999, J. Combin. ... L. Lovász - 《J. Comb. Theory, Ser:a》 被引量: 0发表: 2001年 Polylog...
Energy of Convex Sets, Shortest Paths, and Resistance 来自 掌桥科研 喜欢 0 阅读量: 33 作者: L Lovász 摘要: Let us assign independent, exponentially distributed random edge lengths to the edges of an undirected graph. Lyons, Pemantle, and Peres (1999, J. Combin. Theory Ser. A86 (1999...
Yager R., Paths of least resistence in possibilistic production systems, Fuzzy Sets and Systems, 19 (1986) 121–132. Article MathSciNet MATH Google Scholar Yeh R.T. and Bang S.Y., Fuzzy relations, fuzzy graphs, and their applications to clustering analysis, In: Zadeh, L.A., Fu, K....
This approach attempts to balance between the lack of distributional information and the complete knowledge of the underlying distribution. In particular, Wiesemann et al. (2014) introduce a unified approach to solving distributionally robust convex optimization problems. In this paper we adopt the ...
We study the following problem on reconfiguring shortest paths in graphs: Given two shortest s– t paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s– t path and must differ from the previous one by...
fixed terminal pairs in an unweighted graph, we are asked to determine whether one tuple can be transformed into the other by exchanging a single vertex of one shortest path in the tuple at a time, so that all intermediate results remain tuples of internally vertex-disjoint shortest paths. We...
First, we improve the goal-oriented version of Dijkstra’s algorithm to find shortest paths in huge incomplete grid graphs with edge costs depending on the direction and the layer, and possibly on rectangular regions. We devise estimates of the distance to the targets that offer better trade-...
A combinatorial algorithm to find a shortest triangular path (STP) between two points inside a digital object imposed on triangular grid is designed having O(nglogng) time complexity, n being the number of pixels on the contour of the object and g being the grid size. First the inner ...
Chan, T.M.: All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pp. 514–523 (2006) Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9, 251–280 (1990) Articl...