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.
2011
2011
We give a polynomial time algorithm for bounded directed pathwidth. Given a positive integer k and a digraph G with n vertices… 
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… 
2001
2001
The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent… 
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…