Weighted Ternary Trees as Data Structures for Dendritic Molecules. (C2001)

doi 10.26756/th.2001.15
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Lebanese American University

Related search

Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2019English

Two Algorithms for Generating Weighted Spanning Trees in Order

SIAM Journal on Computing
MathematicsComputer Science
1977English

Weighted Voting for Replicated Data

1979English

BI as an Assertion Language for Mutable Data Structures

2001English

Mutualsolubility and Equilibrium Data for Ternary Systems

Journal of Chemical Engineering of Japan
ChemistryChemical Engineering
1972English

Data Structures for Big Data

International Journal of Computing and Optimization
2014English

Reinforcement Learning in Dendritic Structures

BMC Neuroscience
NeuroscienceCellularMolecular Neuroscience
2011English

Weighted Spanning Trees on Some Self-Similar Graphs

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2011English

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy