Ranking, unranking and random generation of extensional acyclic digraphs

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

zbMATH Keywords

combinatorial problemsdirected acyclic graphgraph algorithmsrandom generationhereditarily finite setsextensional digraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (max. 100)

Set graphs. IV. Further connections with claw-freeness

This page was built for publication: Ranking, unranking and random generation of extensional acyclic digraphs