Results 1  10
of
13,254
A Technique for Drawing Directed Graphs
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1993
"... We describe a fourpass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce cros ..."
Abstract

Cited by 252 (18 self)
 Add to MetaCart
We describe a fourpass algorithm for drawing directed graphs. The first pass finds an optimal rank assignment using a network simplex algorithm. The second pass sets the vertex order within ranks by an iterative heuristic incorporating a novel weight function and local transpositions to reduce
CuntzKrieger algebras of directed graphs
, 1996
"... We associate to each rowfinite directed graph E a universal CuntzKrieger C  algebra C (E), and study how the distribution of loops in E affects the structure of C (E). We prove that C (E) is AF if and only if E has no loops. We describe an exit condition (L) on loops in E which allow ..."
Abstract

Cited by 213 (45 self)
 Add to MetaCart
We associate to each rowfinite directed graph E a universal CuntzKrieger C  algebra C (E), and study how the distribution of loops in E affects the structure of C (E). We prove that C (E) is AF if and only if E has no loops. We describe an exit condition (L) on loops in E which
Directed graph
"... “Data provenance: ” Where does this piece of data come from? “Workflow provenance, Process provenance: ” What happened? scientific databases, computational science, operating systems, debugging, workflow management • need for a common data model for provenance information ..."
Abstract
 Add to MetaCart
“Data provenance: ” Where does this piece of data come from? “Workflow provenance, Process provenance: ” What happened? scientific databases, computational science, operating systems, debugging, workflow management • need for a common data model for provenance information
Testing Subgraphs in Directed Graphs
 Proc. of the 35 th Annual Symp. on Theory of Computing (STOC
, 2003
"... Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least #n edges have to be deleted from it to make it Hfree. We show that in this case G contains at least f(#, H)n copies of H. This is proved by establishing a directed version of Sz ..."
Abstract

Cited by 62 (15 self)
 Add to MetaCart
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least #n edges have to be deleted from it to make it Hfree. We show that in this case G contains at least f(#, H)n copies of H. This is proved by establishing a directed version
Laplacians and the Cheeger Inequality for Directed Graphs
 Annals of Combinatorics
, 2005
"... We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We then define a Cheeger constant and establish the Cheeger inequality for directed graphs. These relations can be used ..."
Abstract

Cited by 102 (4 self)
 Add to MetaCart
We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We then define a Cheeger constant and establish the Cheeger inequality for directed graphs. These relations can be used
Quantum walks on directed graphs
 Quantum Inf. Comp
, 2007
"... We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (vi, vj), if vi is connected to vj then there is a path from vj to vi. We show that reversibility is a necessary and sufficient condition for a directed graph to allow the n ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
We consider the definition of quantum walks on directed graphs. Call a directed graph reversible if, for each pair of vertices (vi, vj), if vi is connected to vj then there is a path from vj to vi. We show that reversibility is a necessary and sufficient condition for a directed graph to allow
Depth first search and linear graph algorithms
 SIAM JOURNAL ON COMPUTING
, 1972
"... The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components of an undirect ..."
Abstract

Cited by 1406 (19 self)
 Add to MetaCart
The value of depthfirst search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and ar algorithm for finding the biconnected components
Orthogonal Structures in Directed Graphs
"... this paper is to show how the concept of 1weightings and the technique used by Frank can be used to obtain a similar theory for directed graphs. In the next section we develop the network flow method and show how this method can be used to obtain a sequence of orthogonal pairs in directed graphs. ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
this paper is to show how the concept of 1weightings and the technique used by Frank can be used to obtain a similar theory for directed graphs. In the next section we develop the network flow method and show how this method can be used to obtain a sequence of orthogonal pairs in directed graphs
Results 1  10
of
13,254