Publications with Hasan Uzun
On verifying and engineering the well-gradedness of a
union-closed family.
D. Eppstein,
J.-C.
Falmagne, and
H. Uzun.
arXiv:0704.2919.
38th Meeting of the European Mathematical Psychology Group, Luxembourg, 2007.
J. Mathematical Psychology 53 (1): 34–39, 2009.
We describe tests for whether the union-closure of a set family is well-graded, and algorithms for finding a minimal well-graded union-closed superfamily of a given set family.