Randomized algorithms to generate hypergraphs with given degree sequences
arxiv(2024)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要