Results 91 to 100 of about 94,026 (313)
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source
Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
IJID (International Journal on Informatics for Development), 2014 Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj +1 more source
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Advanced Materials, EarlyView.Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source
Spanning trees with generalized degree constraints arising in the design of wireless networks
, 2011 In this paper we describe a minimum spanning tree problem with generalized degree constraints which arises in the design of wireless networks. The signal strength on the receiver side of a wireless link decreases with the distance between transmitter and
Luís Gouveia +5 more
core +1 more source
Using dempster-shafer theory to fuse multiple information sources in region-based segmentation [PDF]
, 2007 This paper presents a new method for segmentation of images into large regions that reflect the real world objects present in a scene. It explores the feasibility of utilizing spatial configuration of regions and their geometric properties (the so-called
O'Connor, Noel E. +4 more
core +1 more source
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Discussiones Mathematicae Graph Theory, 2016 Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj +1 more source
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Atomistic Mechanisms Triggered by Joule Heating Effects in Metallic Cu‐Bi Nanowires for Spintronics
Advanced Materials, EarlyView.Bi doped metallic Cu nanowires are promising for spintronics thanks to the stabilization of a giant spin Hall effect. However, heat resulting from current injection forces Bi to leave solution, forcing segregation into monoatomic decorations which evolve into coherent crystalline aggregates.
Alejandra Guedeja‐Marrón +6 more
wiley +1 more source
Asymptotic Enumeration of Spanning Trees [PDF]
Combinatorics, Probability and Computing, 2005 We give new formulas for the asymptotics of the number of spanning trees of a large graph. A special case answers a question of McKay [Europ. J. Combin. 4 149–160] for regular graphs. The general answer involves a quantity for infinite graphs that we call ‘tree entropy’, which we show is a logarithm of a normalized determinant of the graph Laplacian ...
openaire +3 more sources
Polymorph‐Specific Electronic Transduction in WO3 during Molecular Sensing
Advanced Materials, EarlyView.Metal‐oxide polymorphs with similar surface chemistry can nevertheless exhibit distinct sensing properties. In γ‐ and ε‐WO3, analyte adsorption appears comparable; yet, only ε‐WO3 induces a pronounced lattice electronic perturbation that accommodates charge in sub‐conduction band minimum states.
Matteo D'Andria +6 more
wiley +1 more source