Results 261 to 270 of about 1,179,483 (299)
Some of the next articles are maybe not open access.
Estimating the length of minimal spanning trees in compression of files
BIT, 1984Compression of a formatted file by a minimal spanning tree (MST) is studied. Here the records of the file are considered as the nodes of a weighted undirected graph. Each record pair is connected in the graph and the corresponding arc is weighted by the sum of field lengths of those fields which differ in the two records. The actual compression is made
Jarmo Ernvall, Olli Nevalainen
openaire +1 more source
The Expected Length of a Minimal Spanning Tree of a Cylinder Graph
Combinatorics, Probability and Computing, 2006A cylinder graph is the graph Cartesian product of a path and a cycle. In this paper we investigate the length of a minimal spanning tree of a cylinder graph whose edges are assigned random lengths according to independent and uniformly distributed random variables. Our work was inspired by a formula of J.
Kevin R. Hutson, Thomas M. Lewis
openaire +1 more source
On random minimum length spanning trees
Combinatorica, 1989We extend and strengthen the result that, in the complete graphKn with independent random edge-lengths uniformly distributed on [0, 1], the expected length of the minimum spanning tree tends toζ(3) asn→∞. In particular, ifKn is replaced by the complete bipartite graphKn, n then there is a corresponding limit of 2ζ (3).
Alan M. Frieze, Colin J. H. McDiarmid
openaire +1 more source
MODE LOCALIZATION IN SIMPLY SUPPORTED TWO-SPAN BEAMS OF ARBITRARY SPAN LENGTHS
Journal of Sound and Vibration, 1998The present study is concerned with the occurrence and the vari&tion of the mode localization in both periodic beams and non periodic ones.
Dong-Ok Kim, In-Won Lee
openaire +1 more source
On random minimum length spanning trees
2018Mathematics Technical ...
Frieze, McDiarmid, C. J. H.
openaire +1 more source
Constructing minimal spanning/Steiner trees with bounded path length
Integration, 1997Summary: This paper presents an exact algorithm and two heuristics for solving the Bounded path length Minimal Spanning Tree (BMST) problem. The exact algorithm which is based on iterative negative-sum-exchanges(s) has polynomial space complexity and is hence more practical than the method presented by Gabow. The first heuristic method (BKRUS) is based
Jaewon Oh, Iksoo Pyo, Massoud Pedram
openaire +2 more sources
Polynomial-Length Planning Spans the Polynomial Hierarchy
2002This paper presents a family of results on the computational complexity of planning: classical, conformant, and conditional with full or partial observability. Attention is restricted to plans of polynomially-bounded length. For conditional planning, restriction to plans of polynomial size is also considered.
openaire +1 more source
The span length and cross-sectional design affect values of strength
Dental Materials, 2005The aim of this study was to determine experimentally flexural strength and flexural modulus of fiber-reinforced composite (FRC) with different cross-sectional designs and diameters and tested with different span lengths.Continuous FRC test specimens (n = 6) were made with two different cross-sectional designs, namely circular and rectangular.
Pasi, Alander +2 more
openaire +2 more sources
The effect of isoprenoid side chain length of ubiquinone on life span
Medical Hypotheses, 2003The isoprenoid side chain length of ubiquinone (Q) can have an effect on the life span of mammals. The short living mouse and rat have Q(9), while primates have Q(10) as the major form. Ubiquinones (Qs) having longer hydrophobic tail are likely more imbedded in the mitochondrial inner membrane than the ones having shorter tails.
Abdullah, Olgun +3 more
openaire +2 more sources
Span-Length Distributions of Star-Branched Polymers
Macromolecular Theory and Simulations, 2002Many relations between the physical, rheological or mechanical properties of linear polymers and their molar mass are well known. For disperse polymers, parameters that express these relations are typically related to (a combination of) the moments of the molar-mass distribution.
Cokki Versluis +2 more
openaire +1 more source