Stan Grygiel

Learn More
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graph-coloring programs: one exact, and another one based on heuristics which can give, however, provably exact results on some types of graphs. These programs were incorporated into the(More)
EEcient function representation is very important for speed and memory requirements of multiple-valued de-composers. This paper presents a new representation of multiple-valued relations (functions in particular), called Multiple-Valued Cube Diagram Bundles (MVCDB). MVCDBs improve on Rough Partition representation by labeling their blocks with variable(More)
  • 1