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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Graph embedding algorithms embed a graph into a vector space where the structure and the inherent properties of the graph are… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2015
Highly Cited
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)
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
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
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper, we study the effect of multihop relaying on the throughput of the downstream channel in cellular networks. In… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper develops a uni(ed enumerative and asymptotic theory of directed two-dimensional lattice paths in half-planes and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
ALBERTO O. MENDELZONy AND PETER T. WOODz Abstract. We consider the following problem: given a labelled directed graph G and a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1982
Highly Cited
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
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
We consider economical representations for the path information in a directed graph. A directed graph G is said to be a… (More)
  • figure 1
  • figure 2
Is this relevant?