Results 71 to 80 of about 2,238,100 (388)
On the Properties of Gromov Matrices and their Applications in Network Inference
, 2019 The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a heuristic procedure ...
Ji, Feng, Tang, Wenchang, Tay, Wee Peng
core +1 more source
Mathematical and Computer Modelling, 1991 Given a connected graph \(G\), it is shown that the number of labelled spanning trees of \(G\) is equal to the determinant of a cycle-cycle incidence matrix. Using this cycle-based approach, it is seen that the graph of a convex polyhedron and its dual have the same number of spanning trees. The method can also be used to show that certain sequences of
openaire +2 more sources
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
IEEE Access, 2020 This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus ...
Dianhao Zheng +4 more
doaj +1 more source
Orderly Spanning Trees with Applications [PDF]
SIAM Journal on Computing, 2005 25 pages, 7 figures, A preliminary version appeared in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington D.C., USA, January 7-9, 2001, pp.
CHIANG, YI-TING +2 more
openaire +4 more sources
Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method
Journal of Intelligent Systems, 2014 Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets (SVNSs) are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and ...
Jun Ye
semanticscholar +1 more source
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Spanning trees with a bounded number of leaves [PDF]
Opuscula Mathematica, 2017 In 1998, H. Broersma and H. Tuinstra proved that: Given a connected graph \(G\) with \(n\geq 3\) vertices, if \(d(u)+d(v)\geq n-k+1\) for all non-adjacent vertices \(u\) and \(v\) of \(G\) (\(k\geq 1\)), then \(G\) has a spanning tree with at most \(k ...
Junqing Cai +3 more
doaj +1 more source
Spanning Trees in Random Satisfiability Problems
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour +6 more
core +1 more source
Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target
FEBS Letters, EarlyView.This study shows Plasmodium falciparum GEP1 is vital for activating sexual stages of malarial parasites even independently of a mosquito factor. Knockout parasites completely fail gamete formation even when a phosphodiesterase inhibitor is added. Two single‐nucleotide polymorphisms (V241L and S263P) are found in 12%–20% of field samples.
Frederik Huppertz +5 more
wiley +1 more source