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.
2019
2019
Parking Functions on Directed Graphs and Some Directed Trees
Classical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an… 
2016
2016
Extracting Soil Water Holding Capacity Parameters of a Distributed Agro-Hydrological Model from High Resolution Optical Satellite Observations Series
Sentinel-2 (S2) earth observation satellite mission, launched in 2015, is foreseen to promote within-field decisions in Precision… 
2016
2016
Controller to CFO: Not a Straight, Simple Path; Controllers Hoping to Become a CFO Need Operational Experience, Communication Skills
[ILLUSTRATION OMITTED] A declining number of large U.S. companies are tapping controllers to be CFOs, in part because the CFO… 
2014
2014
Minimum Gradient Forwarding for Wireless Sensor Networks
Recent interest in sensor networks has led to a number of routing schemes that more efficiently use the limited resources… 
2012
2012
The Hitting Time of Rainbow Connection Number Two
In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number… 
2007
2007
Spatial instabilities and size limitations of flocks
The movement of flocks with a single leader (and a directed path from it to every agent) can be stabilized over time as has been… 
2004
2004
An incentive mechanism for message relaying in peer-to-peer discovery
Peer discovery via distributed message relaying is an important function of a P2P system in which the resources/services provided… 
2002
2002
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
AbstractAbstract. In this paper we study the collision-free path planning problem for a point robot, whose path is of bounded… 
1998
1998
Path, Tree and Cycle Location
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points… 
1997
1997
Evolutionary action maps for navigating a robot in an unknown, multidimensional, stationary environment. II. Implementation and results
Here, the BGM that is suggested in the first part of this paper used to construct a complete path planner for an agent of… 
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)