학술논문
Randomized algorithms to generate hypergraphs with given degree sequences
Document Type
Working Paper
Source
Subject
Language
Abstract
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.