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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph This graph is a fascinating… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We describe a four-pass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network… (More)
  • figure 1-2
  • figure 1-3
  • figure 2-3
  • figure 2-4
  • figure 2-5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Despite serious concerns raised by the proven ability of computer viruses to spread between individua.1 systems and establish… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic model… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms… (More)
Is this relevant?
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… (More)
  • figure 2
  • table 2
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?