Random generation of Git graphs

DOI10.4204/EPTCS.403.18MaRDI QIDQ6934113zbMATH OpenFDO

Authors Julien Courtiel, Martin Pépin

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.403.18

zbMATH Keywords

directed acyclic graphuniform random generation of graphs

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A calculus for the random generation of labelled combinatorial structures
• Analytic combinatorics
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• scientific article; zbMATH DE number 3748431 (Why is no real title available?)
• Memoire on divergent series.
• Theoretical Analysis of Git Bisect

Cited in

(1)

• Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs

This page was built for publication: Random generation of Git graphs

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