Skip to search formSkip to main contentSkip to account menu

Path (graph theory)

Known as: Dipath, Path, Vertex independent path 
In graph theory, a path in a graph is a finite or infinite sequence of edges which connect a sequence of vertices which, by most definitions, are all… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Two improved particle swarm optimization algorithms are given to overcome the defects in the commonly used particle swarm… 
2014
2014
This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an… 
2006
2006
This paper analyzes the characteristics of a multi-hop 802.11b mobile ad hoc network. We present data gathered from a mobile… 
Highly Cited
2006
Highly Cited
2006
In this paper we analyse a previously introduced swarm intelligence control mechanism used for solving problems of robot path… 
2005
2005
Abstract.In this paper, we consider acyclic networks of queues as a model to support the design of a dynamic production system… 
2002
2002
In this paper, we propose a topological metaphor for computations: computing consists in moving through a path in a data space… 
1998
1998
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points… 
1995
1995
We study the complexity of finding the values and optimal strategies of mean payoff games, a family of perfect information games… 
1977
1977
SHEAR waves have been only rarely observed in explosion seismology studies at sea, so their precise velocities have not been…