Results 21 to 30 of about 2,699,238 (274)

A Benchmarking Algorithm to Determine Minimum Aggregation Delay for Data Gathering Trees and an Analysis of the Diameter-Aggregation Delay Tradeoff

open access: yesAlgorithms, 2015
Aggregation delay is the minimum number of time slots required to aggregate data along the edges of a data gathering tree (DG tree) spanning all the nodes in a wireless sensor network (WSN).
Natarajan Meghanathan
doaj   +1 more source

Diameter partitioning [PDF]

open access: yesDiscrete & Computational Geometry, 1986
Given a set P of points, the diameter of P is the maximum distance of two points from P. In the paper, point sets are partitioned into two subsets satisfying certain requirements on the diameters, and cardinalities or displacement. The problems investigated about such partitions have algorithmic character.
openaire   +2 more sources

The diameter of caterpillar associahedra

open access: yesCoRR, 2021
The caterpillar associahedron $\mathcal{A}(G)$ is a polytope arising from the rotation graph of search trees on a caterpillar tree $G$, generalizing the rotation graph of binary search trees (BSTs) and thus the conventional associahedron. We show that the diameter of $\mathcal{A}(G)$ is $Θ(n + m \cdot (H+1))$, where $n$ is the number of vertices, $m ...
openaire   +6 more sources

On the Diameter of Tree Associahedra [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2018
We consider a natural notion of search trees on graphs, which we show is ubiquitous in various areas of discrete mathematics and computer science. Search trees on graphs can be modified by local operations called rotations, which generalize rotations in binary search trees. The rotation graph of search trees on a graph $G$ is the skeleton of a polytope
Jean Cardinal   +2 more
openaire   +5 more sources

A Note on the Maximum Genus of Graphs with Diameter 4 [PDF]

open access: yes, 2007
Let G be a simple graph with diameter four, if G does not contain complete subgraph K3 of order ...
WeiLi, He, Xiang, Ren, Lin, Zhao
core   +1 more source

Stem taper models for maritime pine plantations in Istanbul Sarıyer Region

open access: yesTurkish Journal of Forestry, 2020
Maritime pine (Pinus pinaster Ait.) is one of the most important tree species in Turkey for establish industrial plantations. In this study, stem taper models were developed for maritime pine plantations in İstanbul-Sarıyer region.
Utkun Karakuyu, Ramazan Ozçeli̇k
doaj   +1 more source

Volume quantity and percentage of Beech industrial, fuel and stump timber portions at Caspian Forests of Iran [PDF]

open access: yesتحقیقات جنگل و صنوبر ایران, 2005
The aim of the study was to investigate the volume and amount of the Beech (Fagus orientalis) industrial, Fuel and stump timber portions at west forests of Gilan province in Caspian Region of Iran.
Farrokh Poorshakoori Allahdeh   +1 more
doaj  

Comparison of height, diameter and wood production of 14 Poplar clones in Esfahan province [PDF]

open access: yesتحقیقات جنگل و صنوبر ایران, 2008
Poplar trees are the fastest growing trees in the northern hemisphere and it woods is suitable for a variety uses and they are the most important resource of wood production. For this reason they are best plant for wood culture.
Haydar Ali Daneshvar   +1 more
doaj  

Amount of carbon sequestration distribution associated with oak tree’s (Quercus castaneifolia C.A. May) bole in relation to physiographical units of Hyrcanian natural forests of Iran [PDF]

open access: yesتحقیقات جنگل و صنوبر ایران, 2014
Carbon sequestration rate of forest trees and their spatial pattern are prominent factors which affect global carbon dynamic and can be basically applied to predict climate change.
Ali Asghar Vahedi, Asadollah Mattagi
doaj   +1 more source

On the Diameter of Matroid Ports [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2008
A clutter or antichain on a set defines a hypergraph. Matroid ports are a special class of clutters, and this paper deals with the diameter of matroid ports, that is, the diameter of the corresponding hypergraphs. Specifically, we prove that the diameter of every matroid port is at most $2$.
Jaume Martí-Farré   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy