Weighted 2-sections and hypergraph reconstruction

DOI10.1016/j.tcs.2022.02.016OpenAlexW4213412353MaRDI QIDQ2143117

Krzysztof Turowski, Robert Janczewski, Paweł Obszarski

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

computational complexityhypergraphs2-sections

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

The generalized microscopic image reconstruction problem for hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On clique partitions of split graphs
• The Steiner tree problem
• Subgraphs in non-uniform random hypergraphs
• On the Desirability of Acyclic Database Schemes
• Syntactic Characterization of Tree Database Schemas
• Edge Clique Partition of K 4-Free and Planar Graphs
• The NP-Completeness of Edge-Coloring
• Algorithmic Aspects of Vertex Elimination on Graphs
• Discovery Science
• k-Degenerate Graphs
• Hardness and structural results for half-squares of restricted tree convex bipartite graphs

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