Results 51 to 60 of about 227,714 (275)
A Survey of Two Optimization Methods to Solve a Modified Minimal Spanning Tree Problem in Undirected Tree Graph [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2011 The paper tackled a survey of two optimization methods to study spanning tree problem by modifying the spanning tree problem to generate all of possible solutions in undirected tree graph with simulated annealing algorithm and ant colony optimization ...
Isra Alkallak, Ruqaya Sha’ban
doaj +1 more source
On encodings of spanning trees
Discrete Applied Mathematics, 2007 AbstractDeo and Micikevicius recently gave a new bijection for spanning trees of complete bipartite graphs. In this paper we devise a generalization of Deo and Micikevicius's method, which is also a modification of Olah's method for encoding the spanning trees of any complete multipartite graph K(n1,…,nr).
openaire +2 more sources
Drawing a tree as a minimum spanning tree approximation
Journal of Computer and System Sciences, 2010 AbstractWe introduce and study (1+ε)-EMST drawings, i.e., planar straight-line drawings of trees such that, for any fixed ε>0, the distance between any two vertices is at least 11+ε the length of the longest edge in the path connecting them. (1+ε)-EMST drawings are good approximations of Euclidean minimum spanning trees.
DI GIACOMO, Emilio +3 more
openaire +4 more sources
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
Population Ecology, EarlyView.We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
Edge-Preserving Stereo Matching Using Minimum Spanning Tree
IEEE Access, 2019 Despite that the accuracy and efficiency of stereo matching technology have significantly improved in the past decades, the issue of edge-blurring remains a challenge to most of the existing approaches.
Congxuan Zhang +5 more
doaj +1 more source
Discrete Mathematics, 1992 Abstract We refer to [2] for terminology not specified here. Graphs mentioned in this note are undirected, simple. The following definition is due to Halin [1]: an end E of an infinite graph G is a set of 1-way infinite paths in G such that P,Q ϵ E iff for any finite subset R of V(G) there is a finite path in G −R joining P and Q.
openaire +2 more sources
A distributed spanning tree algorithm
DAIMI Report Series, 1987 We present a distributed algorithm for constructing a spanning tree for connected undirected graphs. Nodes correspond to processors and edges correspond to two-way channels. Each processor has initially a distinct identity and all processors perform the same algorithm. Computation as well as communication is asynchronous.
Johansen, Karl Erik +4 more
openaire +4 more sources
Spanning Trees on the Sierpinski Gasket [PDF]
Journal of Statistical Physics, 2007 We obtain the numbers of spanning trees on the Sierpinski gasket $SG_d(n)$ with dimension $d$ equal to two, three and four. The general expression for the number of spanning trees on $SG_d(n)$ with arbitrary $d$ is conjectured. The numbers of spanning trees on the generalized Sierpinski gasket $SG_{d,b}(n)$ with $d=2$ and $b=3,4$ are also obtained.
Shu-Chiuan Chang +3 more
openaire +4 more sources
Universal Loop-Free Super-Stabilization [PDF]
, 2010 We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to a shortest path tree). Our scheme combines a novel super-stabilizing loop-
Blin, Lélia +3 more
core +3 more sources