343 search results - page 29 / 69 » On Making Directed Graphs Transitive |
101
click to vote
RSA
2010
15 years 9 days ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
135
Voted
TOPNOC
2008
15 years 1 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
179
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
162
click to vote
LICS
1991
IEEE
15 years 5 months ago
1991
IEEE
d Abstract) Maria Luisa Bonet∗ Samuel R. Buss∗ Department of Mathematics Department of Mathematics U.C. Berkeley U.C. San Diego Berkeley, California 94720 La Jolla, California ...
112
Voted
VIP
2003
15 years 3 months ago
2003
When the amount of information in visualization becomes large enough, users can not perceive all elements at the same time. This problem can be solved by removing parts of the inf...