On the Number of Maximal Vertices of a Random Acyclic Digraph

DOI10.1137/1120047zbMATH Open0362.60030OpenAlexW2011857629MaRDI QIDQ4136266FDOQ4136266

Authors:

Publication date: 1975

Published in: Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1120047

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial probability (60C05)

Cited In (11)

• Counting acyclic digraphs by sources and sinks
• Uniform random generation of large acyclic digraphs
• On the number of labeled acyclic digraphs
• Acyclic digraphs
• On the shape of a random acyclic digraph
• Exact enumeration of acyclic deterministic automata
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Asymptotic enumeration of extensional acyclic digraphs
• Enumeration of connected components of acyclic digraph
• A comparison of random task graph generation methods for scheduling problems
• Counting directed acyclic and elementary digraphs

This page was built for publication: On the Number of Maximal Vertices of a Random Acyclic Digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4136266)