Results 61 to 70 of about 26,432 (163)
Shortest path counting in probabilistic biological networks
BMC Bioinformatics, 2018 Background Biological regulatory networks, representing the interactions between genes and their products, control almost every biological activity in the cell.
Yuanfang Ren, Ahmet Ay, Tamer Kahveci
doaj +1 more source
PLoS ONE, 2022 In this article, a new path planning algorithm is proposed. The algorithm is developed on the basis of the algorithm for finding the best value using multi-objective evolutionary particle swarm optimization, known as the MOEPSO. The proposed algorithm is
Ittikon Thammachantuek, Mahasak Ketcham
doaj +1 more source
Shortest-Path Kernels on Graphs [PDF]
Fifth IEEE International Conference on Data Mining (ICDM'05), 2006 Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available by defining a kernel function on instances of graphs. Graph kernels based on walks, subtrees and cycles in graphs have been proposed so far. As a general problem, these kernels
Karsten M. Borgwardt, Hans-Peter Kriegel
openaire +3 more sources
OVERVIEW OF METHODS AND ALGORITHMS OF CONSTRUCTING SHORTEST PATHS AND PROSPECTS OF THEIR DEVELOPMENT
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2020 Despite the numerous works related to the problem of finding the shortest paths (SP), attention to the development of speed-efficient algorithms for constructing SP is not reduced.
О.М. Трофимчук +2 more
doaj +1 more source
An Efficient Approximation of Betweenness Centrality for Uncertain Graphs
IEEE Access, 2019 Betweenness centrality measures the centrality of nodes and edges in a graph based on the concept of shortest paths. However, such a definition is unsuitable for uncertain graphs due to the uncertainty of links. In the possible-world semantics, the Monte
Chenxu Wang, Ziyuan Lin
doaj +1 more source
On the Quadratic Shortest Path Problem [PDF]
, 2015 Finding the shortest path in a directed graph is one of the most important combinatorial optimization problems, having applications in a wide range of fields. In its basic version, however, the problem fails to represent situations in which the value of the objective function is determined not only by the choice of each single arc, but also by the ...
Borzou Rostami +3 more
openaire +3 more sources
Estimation and update of betweenness centrality with progressive algorithm and shortest paths approximation. [PDF]
Sci Rep, 2023 Xiang N, Wang Q, You M.
europepmc +1 more source
Shortest Paths in Reachability Graphs
Journal of Computer and System Sciences, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jörg Desel, Javier Esparza
openaire +1 more source
Knapsack: Connectedness, Path, and Shortest-Path
Accepted in LATIN ...
Palash Dey, Sudeshna Kolay, Sipra Singh
openaire +2 more sources
Системный анализ и прикладная информатикаThe problem of finding all shortest paths between vertices in a graph (APSP) has real-life applications in planning, communication, economics and many other areas.
O. N. Karasik, A. A. Prihozhy
doaj +1 more source