Results 71 to 80 of about 757,039 (224)
Generalized Shortest Path Kernel on Graphs [PDF]
arXiv, 2015 We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification problem, we consider the task of classifying random graphs from two well-known families, by the number of clusters ...
arxiv
Shortest Path Analysis in Social Graphs [PDF]
arXiv, 2014 The shortest path problem is among the most fundamental combinatorial optimization problems to answer reachability queries. It is hard to deter-mine which vertices or edges are visited during shortest path traversals. In this paper, we provide an empirical analysis on how traversal algorithms behave on social networks.
arxiv
Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
, 2007 During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy.
Bauer, Reinhard +2 more
openaire +3 more sources
SOLVING QUICKEST PATH PROBLEM USING AN EXTENDED CONCEPT OF TRANSITIVE CLOSURE METHOD
Jurnal Informatika, 2005 A travel company offers a transportation service by picking up customers from certain places and sending them to the other places. Concerning traffic in time domain function for every path, the problem is how to find the quickest paths in picking up the ...
Rolly Intan
doaj
An Efficient Algorithm for Touring n Circles
MATEC Web of Conferences, 2018 This paper proposed an intelligent algorithm, which can build the shortest path of the intersecting circle sequences in the plane. The problem is transformed to a corresponding problem of computing the shortest path of three disjoint circles.
Ding Yuepeng, Xie Xiong, Jiang Bo
doaj +1 more source
On the Universal Near Shortest Simple Paths Problem [PDF]
arXiv, 2019 This article generalizes the Near Shortest Paths Problem introduced by Byers and Waterman in 1984 using concepts of the Universal Shortest Path Problem established by Turner and Hamacher in 2011. The generalization covers a variety of shortest path problems by introducing a universal weight vector.
arxiv
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
TheScientificWorldJournal, 2014 Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang +5 more
semanticscholar +1 more source
On the minimum eccentricity shortest path problem
Theoretical Computer Science, 2015 Abstract In this paper, we introduce and investigate the Minimum Eccentricity Shortest Path (MESP) problem in unweighted graphs. It asks for a given graph to find a shortest path with minimum eccentricity. Let n and m denote the number of vertices and the number of edges of a given graph. We demonstrate that: • a minimum eccentricity shortest path
Feodor F. Dragan, Arne Leitert
openaire +3 more sources
“rsppfp”: An R package for the shortest path problem with forbidden paths
SoftwareX, 2019 The Shortest Path Problem with Forbidden Paths (SPPFP) is a variant of the original shortest path problem, where the constraints come from a set of forbidden arc sequences that cannot be part of any feasible solution.
Melina Vidoni, Aldo Vecchietti
doaj
Discussiones Mathematicae Graph Theory, 2014 A buttoning of a tree that has vertices v1, v2, . . . , vn is a closed walk that starts at v1 and travels along the shortest path in the tree to v2, and then along the shortest path to v3, and so forth, finishing with the shortest path from vn to v1 ...
Short Ian
doaj +1 more source