Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Faster scaling algorithms for network problems
SIAM Journal on Computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Geometric symmetry in graphs
The symmetry number problem for trees
Information Processing Letters
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Spring Algorithms and Symmetry
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Algorithms for solving the symmetry number problem on trees
Information Processing Letters
A scaling algorithm for weighted matching on general graphs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.89 |
The symmetry number of a tree is defined as the number of nodes of the maximum subtree of the tree that exhibits axial symmetry. The best previous algorithm for computing the symmetry number for an unrooted unordered tree is due to [P.P. Mitra, M.A.U. Abedin, M.A. Kashem, Algorithms for solving the symmetry number problem on trees, Inform. Process. Lett. 91 (2004) 163-169] and runs in O(n^3) time. In this paper we show an improvement on this time complexity by encoding small trees. Our algorithm runs in time O(n^3(loglogn/logn)^2).