Note on the weighted internal path length of b-ary trees

Note on the weighted internal path length of b-ary trees

Show other versions (1)

Analysis of Algorithms

Bibliographic Details
Main Authors:	Ludger Rüschendorf, Eva-Maria Schopp
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2007-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/403/pdf

Similar Items

Exponential bounds and tails for additive random recursive sequences
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)

On the length of shortest 2-collapsing words
by: Alessandra Cherubini, et al.
Published: (2009-01-01)

On-line Ramsey numbers for paths and stars
by: J. A. Grytczuk, et al.
Published: (2008-01-01)

Digital search trees with m trees: Level polynomials and insertion costs
by: Helmut Prodinger
Published: (2011-08-01)

On the Book Thickness of k-Trees
by: Vida Dujmović, et al.
Published: (2011-10-01)

Adjoint functors and tree duality
by: Jan Foniok, et al.
Published: (2009-01-01)

The Laplacian spread of a tree
by: Yi-Zheng Fan, et al.
Published: (2008-01-01)

On paths, trails and closed trails in edge-colored graphs
by: Laurent Gourvès, et al.
Published: (2012-09-01)

On the kth Eigenvalues of Trees with Perfect Matchings
by: An Chang, et al.
Published: (2007-01-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

The Variance of the Profile in Digital Search Trees
by: Ramin Kazemi, et al.
Published: (2011-09-01)

Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01)

The location of the first maximum in the first sojourn of a Dyck path
by: Helmut Prodinger
Published: (2008-01-01)

A note on compact and compact circular edge-colorings of graphs
by: Dariusz Dereniowski, et al.
Published: (2008-01-01)

On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
by: Nicolas Bédaride, et al.
Published: (2010-01-01)

A note on planar Ramsey numbers for a triangle versus wheels
by: Guofei Zhou, et al.
Published: (2012-11-01)

String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01)

Tree-width and large grid minors in planar graphs
by: Alexander Grigoriev
Published: (2011-02-01)

Structure of spanning trees on the two-dimensional Sierpinski gasket
by: Shu-Chiuan Chang, et al.
Published: (2011-01-01)

Analysis of some parameters for random nodes in priority trees
by: Alois Panholzer
Published: (2008-01-01)

On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01)

Recurrence among trees with most numerous efficient dominating sets
by: Dorota Bród, et al.
Published: (2008-01-01)

The largest singletons in weighted set partitions and its applications
by: Yidong Sun, et al.
Published: (2011-12-01)

Parameterized Problems Related to Seidel's Switching
by: Eva Jelinkova, et al.
Published: (2011-05-01)

A Note on t-designs with t Intersection Numbers
by: Rajendra M. Pawale
Published: (2004-01-01)

Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
by: Véronique Bruyère, et al.
Published: (2007-01-01)

Coding partitions
by: Fabio Burderi, et al.
Published: (2007-01-01)

A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)

Baire and automata
by: Pierre Simonnet, et al.
Published: (2007-01-01)

FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
by: Pascale Minet, et al.
Published: (2007-01-01)

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-01-01)

Properties of the extremal infinite smooth words
by: Srečko Brlek, et al.
Published: (2007-01-01)

"Trivializing'' generalizations of some Izergin-Korepin-type determinants
by: Tewodros Amdeberhan, et al.
Published: (2007-01-01)

Waiting time distributions for pattern occurrence in a constrained sequence
by: Valeri T. Stefanov, et al.
Published: (2007-01-01)

Approximation and inapproximability results on balanced connected partitions of graphs
by: Frédéric Chataigner, et al.
Published: (2007-01-01)

Probe split graphs
by: Van Bang Le, et al.
Published: (2007-01-01)

Ambiguity in the m-bonacci numeration system
by: Petra Kocábová, et al.
Published: (2007-01-01)

Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation
by: Philippe Dumas, et al.
Published: (2007-01-01)

Arithmetics in β-numeration
by: Julien Bernat
Published: (2007-01-01)

Complexity results on graphs with few cliques
by: Bill Rosgen, et al.
Published: (2007-01-01)