Path

Known as: Dipath, Vertex independent path, Edge 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2017
010203019782017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We say an algorithm on n by n matrices with entries in [-M, M] (or n-node graphs with edge weights from [-M, M]) is truly sub… (More)
Is this relevant?
2008
2008
This paper presents a 3D path planing algorithm for an unmanned aerial vehicle (UAV) operating in cluttered natural environments… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
In this paper we investigate the potential benefits of coordinated congestion control for multipath data transfers, and contrast… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
Constrained path problems have to do with finding paths in graphs subject to constraints. We present a constraint programming… (More)
  • figure 1
  • figure 2
  • figure 5
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, a knowledge based genetic algorithm (GA) for path planning of a mobile robot is proposed, which uses problem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This work explores the feasibility of improving the performance of end-to-end data transfers between different sites through path… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the <i>shortest paths… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We define a function that finds a path between two given nodes of a given directed graph, if such a path exists. We prove the… (More)
  • figure 2.1
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • table 6.1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , we consider the problem… (More)
  • figure 6
  • figure 7
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We consider the following problem: given a labelled directed graph G and a regular expression R, find all pairs of nodes… (More)
  • figure 1.1
  • figure 1.2
  • figure 3.2
  • figure 3.1
  • figure 4.1
Is this relevant?