Ranking, unranking and random generation of extensional acyclic digraphs
From MaRDI portal
Publication:1941716
DOI10.1016/j.ipl.2013.01.010zbMath1259.05172OpenAlexW1983094587MaRDI QIDQ1941716
Romeo Rizzi, Alexandru I. Tomescu
Publication date: 21 March 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.01.010
combinatorial problemsdirected acyclic graphgraph algorithmsrandom generationhereditarily finite setsextensional digraph
Related Items (max. 100)
This page was built for publication: Ranking, unranking and random generation of extensional acyclic digraphs