scientific article

DOI<164::AID-RSA1004>3.0.CO;2-H 10.1002/1098-2418(200103)18:2<164::AID-RSA1004>3.0.CO;2-HzbMath1016.60012MaRDI QIDQ2712580

R. Tungol, Boris G. Pittel

Publication date: 27 July 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

phase transitionrandom graphvertex closure

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80)

Related Items (8)

Evaluating topological ordering in directed acyclic graphs ⋮ A dynamic topological sort algorithm for directed acyclic graphs ⋮ Poset limits and exchangeable random posets ⋮ Order-invariant measures on causal sets ⋮ Average-Case Analysis of Online Topological Ordering ⋮ Average-case analysis of incremental topological ordering ⋮ Continuum limits for classical sequential growth models ⋮ On tail distribution of interpost distance

Cites Work

• Random graph orders
• An improved algorithm for transitive closure on acyclic digraphs
• The transitive closure of a random digraph
• On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$

This page was built for publication: