1756 search results - page 23 / 352 » Directed scale-free graphs |
78
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
120
Voted
DCC
2011
IEEE
14 years 7 months ago
2011
IEEE
We show that (n, 2n ) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to ...
90
Voted
STOC
2003
ACM
16 years 22 days ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
109
click to vote
ECCC
2006
15 years 14 days ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...