A Data Structure for Dynamically Maintaining Rooted Trees

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.24, Iss.1, 1997-07, pp. : 37-65

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Optimal Labellings of Rooted Directed Trees

By Shao J.Y.

Advances in Applied Mathematics, Vol. 21, Iss. 1, 1998-07 ,pp. : 1-21

Academic Press

Access to resources Recommend Favorite

Some topics in the dynamics of group actions on rooted trees

By Grigorchuk R.

Proceedings of the Steklov Institute of Mathematics, Vol. 273, Iss. 1, 2011-07 ,pp. : 64-175

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series

By Murua A.

Foundations of Computational Mathematics, Vol. 6, Iss. 4, 2006-11 ,pp. : 387-426

Springer Publishing Company

Access to resources Recommend Favorite

Recovering Symbolically Dated, Rooted Trees from Symbolic Ultrametrics

By Böcker S. Dress A.W.M.

Advances in Mathematics, Vol. 138, Iss. 1, 1998-09 ,pp. : 105-125

Academic Press

Access to resources Recommend Favorite

An Exponential Formula for Polynomial Vector Fields II. Lie Series, Exponential Substituition, and Rooted Trees

By Winkel R.

Advances in Mathematics, Vol. 147, Iss. 2, 1999-11 ,pp. : 260-303

Academic Press

Access to resources Recommend Favorite