Efficient Categorical Partition Refinement Algorithm with Explicit Hopcroft's Trick

The authors present a novel formulation of Hopcroft's trick in terms of general trees with weights, called Hopcroft's inequality. They then develop a fibrational partition refinement algorithm that explicitly builds a tree structure to which Hopcroft's inequality applies, leading to improved complexity bounds.