Skarbek's Algorithm for T-Ary Trees

Computer Journal - United Kingdom
doi 10.1093/comjnl/bxk003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Oxford University Press (OUP)

Related search

Drawing Ordered (K − 1)–Ary Trees on K–Grids

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Regular N-Ary Queries in Trees and Variable Independence

IFIP International Federation for Information Processing
English

The Number of M-Ary Search Trees on N Keys

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1997English

Efficient Evaluation of N-Ary Conjunctive Queries Over Trees and Graphs

2006English

Recognition Algorithm for Probe Interval 2-Trees

British Journal of Mathematics & Computer Science
2016English

An Application of $M$-Ary Trees to the Design of Data Structures for Geometric Searching Problems

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
1989English

Congruences for $M$-Ary Partitions.

Mathematica Scandinavica
Mathematics
1975English

A Randomized Algorithm for Comparing Sets of Phylogenetic Trees

2007English

FSA: A Fast Stepwise Addition Algorithm for Constructing Phylogenetic Trees

International Journal of Bioscience, Biochemistry and Bioinformatics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy