Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
random digraphs
Description:
Directed graphs generated according to a probability model, studied in graph theory and combinatorics.
Primary topic:
Limits and Structures in Graph Theory (43%)
Related topics:
Limits and Structures in Graph Theory (43%),
Complex Network Analysis Techniques (10%),
Advanced Graph Theory Research (8%),
Complexity and Algorithms in Graphs (7%)
OpenAlex ID:
keywords/random-digraphs
The transitive closure of a random digraph
1990
·
Richard M. Karp
·
Random Structures and Algorithms
·
249
A parallelization of Dijkstra's shortest path algorithm
1998
·
A. Crauser
, K. Mehlhorn
, et al.
·
Lecture notes in computer science
·
194
An improved algorithm for transitive closure on acyclic digraphs
1988
·
Klaus Simon
·
Theoretical Computer Science
·
127
PDF
On the connectivity of randomm-orientable graphs and digraphs
1982
·
T. I. Fenner
, A. M. Frieze
·
COMBINATORICA
·
104
The Size of the Largest Strongly Connected Component of a Random Digraph with a Given Degree Sequence
2004
·
COLIN COOPER
, ALAN FRIEZE
·
Combinatorics Probability Computing
·
99
On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
1970
·
V. E. Stepanov
·
Theory of Probability and Its Applications
·
85
A probabilistic approach to networks
1979
·
Anatol Rapoport
·
Social Networks
·
77
Clutter percolation and random graphs
1980
·
Colin McDiarmid
·
Mathematical programming studies
·
71
1‐Factorizations of random regular graphs
1997
·
M. S. O. Molloy
, H. Robalewska
, et al.
·
Random Structures and Algorithms
·
56
Stability of shortest paths in complex networks with random edge weights
2002
·
Jae Dong Noh
, Heiko Rieger
·
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
·
55
PDF
On the existence of Hamiltonian cycles in a class of random graphs
1983
·
T.I. Fenner
, A.M. Frieze
·
Discrete Mathematics
·
55
On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
1984
·
Amnon B. Barak
, Paul Erdös
·
SIAM Journal on Algebraic and Discrete Methods
·
54
The phase transition in the evolution of random digraphs
1990
·
Tomasz Łuczak
·
Journal of Graph Theory
·
44
Maximum matchings in a class of random graphs
1986
·
A.M. Frieze
·
Journal of Combinatorial Theory Series B
·
42
Distributed Multiagent Convex Optimization Over Random Digraphs
2019
·
Seyyed Shaho Alaviani
, Nicola Elia
·
IEEE Transactions on Automatic Control
·
41
The critical behavior of random digraphs
2009
·
Tomasz Łuczak
, Taral Guldahl Seierstad
·
Random Structures and Algorithms
·
40
On the distribution of the domination number for random class cover catch digraphs
2001
·
Carey E. Priebe
, Jason G. DeVinney
, et al.
·
Statistics & Probability Letters
·
38
Attack-Resilient Distributed Convex Optimization of Cyber–Physical Systems Against Malicious Cyber-Attacks Over Random Digraphs
2022
·
Zhi Feng
, Guoqiang Hu
·
IEEE Internet of Things Journal
·
37
PDF
Stationary distribution and cover time of random walks on random digraphs
2011
·
Colin Cooper
, Alan Frieze
·
Journal of Combinatorial Theory Series B
·
35
PDF
Domination in Digraphs
1998
·
Chang-Woo Lee
·
Journal of the Korean Mathematical Society
·
35
Random digraphs with given expected degree sequences: A model for economic networks
2011
·
Leonardo Bargigli
, Mauro Gallegati
·
Journal of Economic Behavior & Organization
·
33
List coloring digraphs
2017
·
Julien Bensmail
, Ararat Harutyunyan
, et al.
·
Journal of Graph Theory
·
31
PDF
Hamilton cycles in random graphs and directed graphs
2000
·
Colin Cooper
, Alan Frieze
·
Random Structures and Algorithms
·
29
A note on the connectivity of 2‐regular digraphs
1993
·
C. Cooper
·
Random Structures and Algorithms
·
29
Asymptotic Formulas for the Probability of k -Connectedness of Random Graphs
1973
·
A. K. Kel’mans
·
Theory of Probability and Its Applications
·
29
Show more works
View as search
Works count:
254
Citation count:
2,806
Year
Topic
Type