Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,466,099 papers from all fields of science
Search
Sign In
Create Free Account
Path (graph theory)
Known as:
Dipath
, Path
, Vertex independent path
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Alexander Schrijver
Blossom tree (graph theory)
Caterpillar tree
Cograph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A Polynomial Time Algorithm for Bounded Directed Pathwidth
H. Tamaki
International Workshop on Graph-Theoretic…
2011
Corpus ID: 45262094
We give a polynomial time algorithm for bounded directed pathwidth. Given a positive integer k and a digraph G with n vertices…
Expand
2006
2006
Measurements from an 802.11b mobile ad hoc network
Vincent Lenders
,
Jörg Wagner
,
M. May
IEEE International Symposium on a World of…
2006
Corpus ID: 2882553
This paper analyzes the characteristics of a multi-hop 802.11b mobile ad hoc network. We present data gathered from a mobile…
Expand
Highly Cited
2006
Highly Cited
2006
Chain Based Path Formation in Swarms of Robots
Shervin Nouyan
,
M. Dorigo
ANTS Workshop
2006
Corpus ID: 1646082
In this paper we analyse a previously introduced swarm intelligence control mechanism used for solving problems of robot path…
Expand
2005
2005
Distribution function of the shortest path in networks of queues
A. Azaron
,
M. Modarres
OR Spectr.
2005
Corpus ID: 62981932
Abstract.In this paper, we consider acyclic networks of queues as a model to support the design of a dynamic production system…
Expand
2004
2004
Blindfolded dogs relocate a target through path integration
J. Cattet
,
A. Etienne
Animal Behaviour
2004
Corpus ID: 53197173
2003
2003
The permutation-path coloring problem on trees
S. Corteel
,
Mario Valencia-Pabon
,
Danièle Gardy
,
D. Barth
,
A. Denise
Theoretical Computer Science
2003
Corpus ID: 17524745
2001
2001
The first K minimum cost paths in a time-schedule network
Yen-Liang Chen
,
D. Rinks
,
K. Tang
Journal of the Operational Research Society
2001
Corpus ID: 62770064
The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent…
Expand
1998
1998
Path, Tree and Cycle Location
M. Labbé
,
G. Laporte
,
Inmaculada Rodríguez-Martín
1998
Corpus ID: 166662366
Traditional network location theory is concerned with the optimal location of facilities which can be considered as single points…
Expand
1997
1997
Planning robust displacement missions by means of robot-tasks and local maps
N. L. Fort-Piat
,
I. Collin
,
D. Meizel
Robotics Auton. Syst.
1997
Corpus ID: 41215497
1995
1995
The Complexity of Mean Payoff Games
Uri Zwick
,
M. Paterson
International Computing and Combinatorics…
1995
Corpus ID: 8723422
We study the complexity of finding the values and optimal strategies of mean payoff games, a family of perfect information games…
Expand
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)
ACCEPT & CONTINUE