Results 81 to 90 of about 2,238,100 (388)
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
MEMBANGUN POHON MERENTANG MINIMUM DENGAN MENGGUNAKAN ALGORITMA PRIM [PDF]
, 2009 Graph is the method of discrete problem solution searching that was in the real world. Graph has much of concepts. The ones is Tree concept. Tree concept is being the significant and the popular concept because support to applies graph for a lot of ...
SUSIANI, ERNA
core
Visualization of very large high-dimensional data sets as minimum spanning trees [PDF]
Journal of Cheminformatics, 2019 The chemical sciences are producing an unprecedented amount of large, high-dimensional data sets containing chemical structures and associated properties.
Daniel Probst, J. Reymond
semanticscholar +1 more source
FEBS Letters, EarlyView.Phototrophs evolved light‐harvesting systems adapted for efficient photon capture in habitats enriched in far‐red radiation. A subset of eukaryotic pigment‐binding proteins can absorb far‐red photons via low‐energy chlorophyll states known as red forms.
Antonello Amelii +8 more
wiley +1 more source
Efficient Computation of Expectations under Spanning Tree Distributions
Transactions of the Association for Computational Linguistics, 2021 We give a general framework for inference in spanning tree models. We propose unified algorithms for the important cases of first-order expectations and second-order expectations in edge-factored, non-projective spanning-tree models.
Ran Zmigrod, Tim Vieira, Ryan Cotterell
doaj +1 more source
Spanning trees without adjacent vertices of degree 2
, 2019 Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that there exist highly connected graphs in which every spanning tree contains vertices of degree 2.
Lyngsie, Kasper Szabo, Merker, Martin
core +1 more source
The number of spanning trees of a graph [PDF]
Journal of Inequalities and Applications, 2013 Abstract Let G be a simple connected graph of order n, m edges, maximum degree Δ 1 and minimum degree δ. Li et al. (Appl. Math. Lett. 23:286-290, 2010) gave an upper bound on number of spanning trees of a graph in terms of n, m,
Das, Kinkar C. +2 more
openaire +4 more sources
Molecular Oncology, EarlyView.This study explores salivary RNA for breast cancer (BC) diagnosis, prognosis, and follow‐up. High‐throughput RNA sequencing identified distinct salivary RNA signatures, including novel transcripts, that differentiate BC from healthy controls, characterize histological and molecular subtypes, and indicate lymph node involvement.
Nicholas Rajan +9 more
wiley +1 more source
Efficient and Effective Directed Minimum Spanning Tree Queries
Mathematics, 2023 Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory. It is applied in a wide spectrum of fields from computer network and communication protocol design to revenue maximization in social networks and syntactic parsing ...
Zhuoran Wang +4 more
doaj +1 more source
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source