Highly Influential

13 Excerpts

- Published 2012 in Electr. J. Comb.

4 A graph is said to be d-distinguishable if there exists a d-labeling of its vertices which is 5 only preserved by the identity map. The distinguishing number of a graph G is the smallest 6 number d for which G is d-distinguishable. We show that the distinguishing number of trees 7 and forests can be computed in linear time, improving the previously known O(n log n) time 8 algorithm. 9

@article{Seara2012DistinguishingTI,
title={Distinguishing Trees in Linear Time},
author={Carlos Seara and Antoni Lozano and Merc{\`e} Mora},
journal={Electr. J. Comb.},
year={2012},
volume={19},
pages={P19}
}