- given a tree with initial and final labels, find the minimum number of operations to get from one config to the other, where one operation selects an edge and swaps the labels on nodes and . (maybe with general graph too? although, already difficult for cycle) UPD: apparently NP-hard