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… 
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… 
2013
2013
Seat assembly having heating element providing electrical heating of variable temperature along a predetermined path to a zone
A seat assembly is disclosed which has a heating element disposed along a predetermined path in a zone of a bottom seating… 
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… 
2008
2008
An Algorithm for Finding Connected Convex Subgraphs of an Acyclic Digraph
A subgraph H of an acyclic digraph D is convex if there is no directed path between vertices of H which contains an arc not in H… 
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… 
1999
1999
Strong subtournaments of multipartite tournaments
An orientation of a complete graph is a tournament, and an orientation of a complete n-partite graph is an n-partite tournament… 
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…