A note on triangle partitions
classification
💻 cs.DS
cs.DM
keywords
partitionstriangleanalysisboundedcardinalitycaseimproveimprovement
read the original abstract
Koivisto studied the partitioning of sets of bounded cardinality. We improve his time analysis somewhat, for the special case of triangle partitions, and obtain a slight improvement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.