Characterization and reconstruction of hypergraphic pattern sequences

DOI10.1007/978-3-031-23612-9_19MaRDI QIDQ6111448zbMATH OpenOpenAlexFDO

Authors Michela Ascolese, Andrea Frosini

Publication date 3 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-23612-9_19

zbMATH Keywords

image analysisdiscrete tomographyhypergraphdegree sequencesreconstruction problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10) Hypergraphs (05C65)

Recommendations

• A tomographical interpretation of a sufficient condition on h-graphical sequences
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• On the degree sequences of uniform hypergraphs
• On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two
• New sufficient conditions on the degree sequences of uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• A remark on the existence of finite graphs
• A tomographical interpretation of a sufficient condition on h-graphical sequences
• Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
• Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
• Discrete tomography. Foundations, algorithms, and applications
• New results on degree sequences of uniform hypergraphs
• New sufficient conditions on the degree sequences of uniform hypergraphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the degree sequences of uniform hypergraphs
• Optimization over degree sequences
• Properties of unique degree sequences of 3-uniform hypergraphs
• The On-Line Encyclopedia of Integer Sequences

Cited in

(4)

• Randomized algorithms to generate hypergraphs with given degree sequences
• Dense, irregular, yet always-graphic 3-uniform hypergraph degree sequences
• Revisiting Shinohara's algorithm for computing descriptive patterns
• On the reconstruction of 3-uniform hypergraphs from degree sequences of span-two

This page was built for publication: Characterization and reconstruction of hypergraphic pattern sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6111448)