Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Directed graph

Known as: Graph arc, Weighted digraph, Digraph (mathematics) 
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph (that is a set of vertices connected by edges), where… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We consider the PC-algorithm (Spirtes et al., 2000) for estimating the skeleton and equivalence class of a very high-dimensional… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Highly Cited
2006
Highly Cited
2006
We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1993
Highly Cited
1993
A four-pass algorithm for drawing directed graphs is presented. The fist pass finds an optimal rank assignment using a network… Expand
  • figure 1-2
  • figure 1-3
  • figure 2-3
  • figure 2-4
  • figure 2-5
Highly Cited
1991
Highly Cited
1991
The strong analogy between biological viruses and their computational counterparts has motivated the authors to adapt the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1988
Highly Cited
1988
We introduce the notion of geometric constructions in Rm governed by a directed graph G and by similarity ratios which are… Expand
Highly Cited
1986
Highly Cited
1986
  • R. Bryant
  • IEEE Transactions on Computers
  • 1986
  • Corpus ID: 10385726
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… Expand
  • figure 2
  • table 2
  • figure 11
Highly Cited
1986
Highly Cited
1986
Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure… Expand
Highly Cited
1975
Highly Cited
1975
An algorithm is presented which finds all the elementary circuits of a directed graph in time bounded by $O((n + e)(c + 1))$ and… Expand
  • figure 2
  • table 2
Highly Cited
1972
Highly Cited
1972
We consider economical representations for the path information in a directed graph. A directed graph $G^t $ is said to be a… Expand
  • figure 1
  • figure 2
Highly Cited
1972
Highly Cited
1972
  • R. Tarjan
  • SIAM J. Comput.
  • 1972
  • Corpus ID: 16467262
The value of depth-first search or “backtracking” as a technique for solving problems is illustrated by two examples. An improved… Expand
  • figure 1
  • figure 2
  • figure 3