CATALOGO DEI PRODOTTI DELLA RICERCA
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishExtensional acyclic digraphs are acyclic digraphs whose vertices have pairwise different sets of out-neighbors; they represent hereditarily finite sets, which stand at the basis of some computer languages. In this paper we give an O(n^3) algorithm for generating uniformly at random an extensional acyclic digraph on n vertices. This is done by first proposing a linear-time algorithm for encoding such digraphs by particular (n−1)-tuples of subsets of {0,…,n−2}. We then give a new counting recurrence for such tuples, which we exploit in ranking/unranking algorithms. These are also useful for indexing data structures by hereditarily finite sets.
| Titolo: | Ranking, unranking and random generation of extensional acyclic digraphs |
| Autori: | |
| Data di pubblicazione: | 2013 |
| Rivista: | |
| Abstract: | Extensional acyclic digraphs are acyclic digraphs whose vertices have pairwise different sets of out-neighbors; they represent hereditarily finite sets, which stand at the basis of some computer languages. In this paper we give an O(n^3) algorithm for generating uniformly at random an extensional acyclic digraph on n vertices. This is done by first proposing a linear-time algorithm for encoding such digraphs by particular (n−1)-tuples of subsets of {0,…,n−2}. We then give a new counting recurrence for such tuples, which we exploit in ranking/unranking algorithms. These are also useful for indexing data structures by hereditarily finite sets. |
| Handle: | http://hdl.handle.net/11562/606353 |
| Appare nelle tipologie: | 01.01 Articolo in Rivista |
File in questo prodotto:
http://hdl.handle.net/11562/606353
Copyright © 2020