# Path (graph theory)

## Papers overview

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

Highly Cited

2016

Highly Cited

2016

- KDD
- 2016

Graph embedding algorithms embed a graph into a vector space where the structure and the inherent properties of the graph areâ€¦Â (More)

Is this relevant?

Highly Cited

2015

Highly Cited

2015

- IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2015

A non-backtracking walk on a graph is a directed path such that no edge is the inverse of its preceding edge. The nonâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- 2007

Let G be a nontrivial connected graph on which is defined a coloring c : E(G)â†’ {1, 2, . . . , k}, k âˆˆ N, of the edges of G, whereâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- WEA
- 2005

We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, inâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Journal on Selected Areas in Communications
- 2004

In this paper, we study the effect of multihop relaying on the throughput of the downstream channel in cellular networks. Inâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Theor. Comput. Sci.
- 2002

This paper develops a uni(ed enumerative and asymptotic theory of directed two-dimensional lattice paths in half-planes andâ€¦Â (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- VLDB
- 1989

ALBERTO O. MENDELZONy AND PETER T. WOODz Abstract. We consider the following problem: given a labelled directed graph G and aâ€¦Â (More)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- J. Comb. Theory, Ser. B
- 1982

Let G be a directed graph whose edges are coloured with two colours. Call a set S of vertices of G independent if no two verticesâ€¦Â (More)

Is this relevant?

Highly Cited

1976

Highly Cited

1976

- SIAM J. Comput.
- 1976

It is shown that O(N5/2) comparisons and additions suffice to solve the all-pairs shortest path problem for directed graphs on Nâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- SIAM J. Comput.
- 1972

We consider economical representations for the path information in a directed graph. A directed graph G is said to be aâ€¦Â (More)

Is this relevant?