Reconstructing a binary matrix under timetabling constraints

DOI10.1016/j.endm.2005.05.057zbMath1179.15030OpenAlexW1970831420MaRDI QIDQ3439178

Sara Brunetti, Christophe Picouleau, Andrea Frosini

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.05.057

zbMATH Keywords

dynamic programmingpolynomial time algorithmdirected acyclic graphdiscrete tomographybinary matrix

Mathematics Subject Classification ID

Dynamic programming (90C39) Directed graphs (digraphs), tournaments (05C20) Matrices of integers (15B36)

Cites Work

• Reconstructing convex polyominoes from horizontal and vertical projections
• An algorithm reconstructing convex lattice sets.
• Discrete tomography. Foundations, algorithms, and applications
• The reconstruction of polyominoes from their orthogonal projections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing a binary matrix under timetabling constraints