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

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-18469-7_10
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Optimization of Hierarchical Regression Model With Application to Optimizing Multi-Response Regression K-Ary Trees

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

Ray Representation for K-Trees

Pattern Recognition Letters
Signal ProcessingComputer VisionPattern RecognitionArtificial IntelligenceSoftware
1989English

$K$-To-$1$ Functions on Arcs for $K$ Even

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1987English

Constructive Root Bound for K-Ary Rational Input Numbers

2003English

Trees With Equal Global Offensive K-Alliance and K-Domination Numbers

Opuscula Mathematica
Mathematics
2010English

Ordered K-Theoryand Minimal Symbolic Dynamical Systems

Colloquium Mathematicum
Mathematics
2000English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

The (H, K)-Server Problem on Bounded Depth Trees

2017English

A Study of R-Ideals, K-Ideals and M−k Ideals of Ordered Semirings

Asia Pacific Journal of Mathematics
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy