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)

Related topics

Related topics

50 relations
Alexander SchrijverBlossom tree (graph theory)Caterpillar treeCograph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Research on autonomous moving robot path planning based on improved particle swarm optimization
Two improved particle swarm optimization algorithms are given to overcome the defects in the commonly used particle swarm… 
Highly Cited
2010
Highly Cited
2010
Language-specific encoding of placement events in gestures
This study focuses on the effect of the semantics of placement verbs on placement event representations. Specifically, it… 
2006
2006
Measurements from an 802.11b mobile ad hoc network
This paper analyzes the characteristics of a multi-hop 802.11b mobile ad hoc network. We present data gathered from a mobile… 
2005
2005
Distribution function of the shortest path in networks of queues
Abstract.In this paper, we consider acyclic networks of queues as a model to support the design of a dynamic production system… 
2004
2004
Blindfolded dogs relocate a target through path integration
Highly Cited
2003
Highly Cited
2003
Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes
2002
2002
Deconstructing "The Iron Cage"--towards an Aesthetic of Folding
This essay develops elements of an aesthetic of folding. It uses the metaphor of the fold as a moving concept, which allows… 
2001
2001
The first K minimum cost paths in a time-schedule network
The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent… 
1995
1995
The Complexity of Mean Payoff Games
We study the complexity of finding the values and optimal strategies of mean payoff games, a family of perfect information games… 
1990
1990
Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
Abstract There are linear-time sequential algorithms for many fundamental problems related to digraph reachability. In contrast… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)