scientific article; zbMATH DE number 7651064

DOI10.4230/LIPICS.AOFA.2020.25MaRDI QIDQ5874425FDOQ5874425

Authors: Vonjy Rasendrahasina, Dimbinaina Ralaivaosaona, Stephan Wagner 

Publication date: 7 February 2023

Title of this publication is not available (Why is that?)

zbMATH Keywords

asymptoticsrandom digraphsacyclic digraphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cited In (8)

• 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
• The birth of the strong components
• Title not available (Why is that?)
• Counting directed acyclic and elementary digraphs

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)