Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ascolese, Michela, Lienau, Matthias, Schulte, Matthias, Taraz, Anusch
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2402.04737
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866913225779445760
author Ascolese, Michela
Lienau, Matthias
Schulte, Matthias
Taraz, Anusch
author_facet Ascolese, Michela
Lienau, Matthias
Schulte, Matthias
Taraz, Anusch
contents The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem by randomized algorithms which generate the required hypergraph with positive probability if the sequence satisfies certain constraints.
format Preprint
id arxiv_https___arxiv_org_abs_2402_04737
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Randomized algorithms to generate hypergraphs with given degree sequences
Ascolese, Michela
Lienau, Matthias
Schulte, Matthias
Taraz, Anusch
Combinatorics
Probability
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem by randomized algorithms which generate the required hypergraph with positive probability if the sequence satisfies certain constraints.
title Randomized algorithms to generate hypergraphs with given degree sequences
topic Combinatorics
Probability
url https://arxiv.org/abs/2402.04737