\textsc{Minimum Surgical Probing} with convexity constraints

DOI10.1007/978-3-031-34347-6_12MaRDI QIDQ6182899zbMATH OpenOpenAlexFDO

Authors Toni Böhnlein, Niccolò Di Marco, Andrea Frosini

Publication date 22 December 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-34347-6_12

zbMATH Keywords

\(K_h\)-free graphsdiscrete tomographygraph convexitypath convexityreconstruction problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Binary matrices under the microscope: A tomographical problem
• Discrete tomography. Foundations, algorithms, and applications
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• Geodesic Convexity in Graphs
• On local convexity in graphs
• On the convexity number of graphs
• Properties of SAT formulas characterizing convex sets with given projections
• Reconstructing convex polyominoes from horizontal and vertical projections
• Regular switching components
• The generalized microscopic image reconstruction problem
• The generalized microscopic image reconstruction problem for hypergraphs
• Uniqueness in discrete tomography: Three remarks and a corollary
• Weighted microscopic image reconstruction

This page was built for publication: \textsc{Minimum Surgical Probing} with convexity constraints

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