Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes) - researchr publication

researchr

You are not signed in
Sign in
Sign up

Mehdi Naima. Combinatorics of increasing trees under increasing labellings: Asymptotics, bijections and algorithms. (Combinatoire des arbres sous étiquetages croissants: Asymptotiques, bijections et algorithmes). PhD thesis, University Sorbonne Paris Nord, France, 2020. [doi]

Abstract is missing.

runs on WebDSL