Weighted 2-sections and hypergraph reconstruction

DOI10.1016/J.TCS.2022.02.016MaRDI QIDQ2143117zbMATH OpenOpenAlexFDO

Authors R. Janczewski, Paweł Obszarski, Krzysztof Turowski

Publication date 31 May 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.02.016

zbMATH Keywords

2-sectionscomputational complexityhypergraphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The generalized microscopic image reconstruction problem for hypergraphs
• Optimal query complexity for reconstructing hypergraphs
• On the reconstruction of 3-uniform hypergraphs from step-two degree sequences
• Hypergraph recovery algorithms from a given vector of vertex degrees
• Polynomial reconstruction problem for hypergraphs

Cites work

• k-Degenerate Graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Discovery Science
• Edge clique partition of \(K _{4}\)-free and planar graphs
• Graph theory
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 4121434 (Why is no real title available?)
• scientific article; zbMATH DE number 1834638 (Why is no real title available?)
• scientific article; zbMATH DE number 7764108 (Why is no real title available?)
• On clique partitions of split graphs
• On the Desirability of Acyclic Database Schemes
• Subgraphs in non-uniform random hypergraphs
• Syntactic Characterization of Tree Database Schemas
• The NP-Completeness of Edge-Coloring
• The Steiner tree problem

Cited in

(1)

• The generalized microscopic image reconstruction problem for hypergraphs

This page was built for publication: Weighted 2-sections and hypergraph reconstruction

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