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)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2010

Highly Cited

2010

- Virginia Vassilevska Williams, Ryan Williams
- 2010 IEEE 51st Annual Symposium on Foundations ofâ€¦
- 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

- Kwangjin Yang, Salah Sukkarieh
- 2008 IEEE/RSJ International Conference onâ€¦
- 2008

This paper presents a 3D path planing algorithm for an unmanned aerial vehicle (UAV) operating in cluttered natural environmentsâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Peter B. Key, Laurent MassouliÃ©, Donald F. Towsley
- IEEE INFOCOM 2007 - 26th IEEE Internationalâ€¦
- 2007

In this paper we investigate the potential benefits of coordinated congestion control for multipath data transfers, and contrastâ€¦Â (More)

Is this relevant?

2006

2006

- Luis Quesada, Peter Van Roy, Yves Deville, RaphaÃ«l Collet
- PADL
- 2006

Constrained path problems have to do with finding paths in graphs subject to constraints. We present a constraint programmingâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Yanrong Hu, Simon X. Yang
- IEEE International Conference on Robotics andâ€¦
- 2004

In this paper, a knowledge based genetic algorithm (GA) for path planning of a mobile robot is proposed, which uses problemâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Shu Tao, Kuai Xu, +6 authors Zhi-Li Zhang
- Proceedings of the 12th IEEE Internationalâ€¦
- 2004

This work explores the feasibility of improving the performance of end-to-end data transfers between different sites through pathâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Timothy G. Griffin, F. Bruce Shepherd, Gordon T. Wilfong
- IEEE/ACM Trans. Netw.
- 2002

Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the <i>shortest pathsâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Matt Kaufmann, Panagiotis Manolios, J. Strother Moore
- Advances in Formal Methods
- 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)

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)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Alberto O. Mendelzon, Peter T. Wood
- VLDB
- 1989

We consider the following problem: given a labelled directed graph G and a regular expression R, find all pairs of nodesâ€¦Â (More)

Is this relevant?