We devise a unified framework for the design of canonization algorithms. Using hereditarily finite sets, we define a general notion of combinatorial objects that includes graphs, hypergraphs, relational structures, codes, permutation groups, tree decompositions, and so on.
No takes yet. Share an insight, caveat, or question.
Schweitzer et al. (2019) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: