Characterization and reconstruction of hypergraphic pattern sequences
From MaRDI portal
Publication:6111448
DOI10.1007/978-3-031-23612-9_19zbMath1525.68192OpenAlexW4313340753MaRDI QIDQ6111448
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
Computing methodologies for image processing (68U10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- New results on degree sequences of uniform hypergraphs
- New sufficient conditions on the degree sequences of uniform hypergraphs
- Discrete tomography. Foundations, algorithms, and applications
- Properties of unique degree sequences of 3-uniform hypergraphs
- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from Saind arrays
- The On-Line Encyclopedia of Integer 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.
- A remark on the existence of finite graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Optimization over Degree Sequences
- On the Degree Sequences of Uniform Hypergraphs
- A Tomographical Interpretation of a Sufficient Condition on h-Graphical Sequences
This page was built for publication: Characterization and reconstruction of hypergraphic pattern sequences