2463 search results - page 49 / 493 » Rankings of Directed Graphs |
112
click to vote
DCC
2011
IEEE
14 years 6 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 ...
STOC
2003
ACM
16 years 3 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...
100
click to vote
ECCC
2006
14 years 12 months 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...
CATS
2006
15 years 1 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...