scientific article; zbMATH DE number 7651064

DOI10.4230/LIPICS.AOFA.2020.25MaRDI QIDQ5874425zbMATH OpenFDO

Authors Vonjy Rasendrahasina, Dimbinaina Ralaivaosaona, Stephan Wagner

Publication date 7 February 2023

zbMATH Keywords

asymptoticsrandom digraphsacyclic digraphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited in

(8)

• Counting directed acyclic and elementary digraphs
• Exact enumeration of satisfiable 2-SAT formulae
• The diameter of the directed configuration model
• Similarity Suppresses Cyclicity: Why Similar Competitors Form Hierarchies
• Generating functions of some families of directed uniform hypergraphs
• Generating connected acyclic digraphs uniformly at random
• scientific article; zbMATH DE number 4029600 (Why is no real title available?)
• The birth of the strong components

This page was built for publication:

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