Results 51 to 60 of about 5,537,193 (382)
Seven largest trees pack [PDF]
Opuscula MathematicaThe Tree Packing Conjecture (TPC) by Gyárfás states that any set of trees \(T_2,\dots,T_{n-1}, T_n\) such that \(T_i\) has \(i\) vertices pack into \(K_n\). The conjecture is true for bounded degree trees, but in general, it is widely open.
Maciej Cisiński, Andrzej Żak
doaj +1 more source
Jurnal Teknologi Informasi dan Pendidikan, 2023 The COVID-19 pandemic has had a significant impact on various economic sectors in Indonesia, including the education system. Consequently, the educational landscape has undergone substantial changes, such as the shift from traditional classroom ...
Imelda Muluk
doaj +1 more source
A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree [PDF]
, 2012 In this paper, we provide a polynomial time algorithm to calculate the probability of a {\it ranked} gene tree topology for a given species tree, where a ranked tree topology is a tree topology with the internal vertices being ordered. The probability of
Degnan, James H., Stadler, Tanja
core +2 more sources
Deep Tree Net-Vector of Locally Aggregated Descriptor (VLAD) Model
IEEE Access, 2019 In this work, we combined both a tree and a NetVLAD (vector of locally aggregated descriptors) in order to design new deep model. In developing this model, we studied the impact of tree hyperparameters and found that branch factors had major effects on ...
Abduljawad A. Amory +2 more
doaj +1 more source
Classical simulation of quantum many-body systems with a tree tensor network [PDF]
, 2006 We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree.
A. J. Daley +5 more
core +2 more sources
ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees
BMC Bioinformatics, 2018 Evolutionary histories can be discordant across the genome, and such discordances need to be considered in reconstructing the species phylogeny. ASTRAL is one of the leading methods for inferring species trees from gene trees while accounting for gene ...
Chao Zhang +3 more
semanticscholar +1 more source
Trees within trees II: Nested fragmentations [PDF]
Annales de l'Institut Henri Poincaré, Probabilités et Statistiques, 2020 Similarly as in (Blancas et al. 2018) where nested coalescent processes are studied, we generalize the definition of partition-valued homogeneous Markov fragmentation processes to the setting of nested partitions, i.e. pairs of partitions $( , )$ where $ $ is finer than $ $.
openaire +3 more sources
Chromatic number of super vertex local antimagic total labelings of graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G(V,E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, …, |V|+|E|} where f(V)={1, 2, …, |V|}. For a vertex x ∈ V, define its weight w(x) as the sum of labels of all edges incident with x and the vertex label itself. Then f is called a super
Fawwaz F. Hadiputra +4 more
doaj +1 more source
Like Mother, Like Daughter [PDF]
, 2019 My motivation for this piece was to shed light on what it is like growing up with a heritage, knowing it from your experience and family, and yet, having people challenge you your whole life to prove it.
Mcgrath, Savannah Fox-Tree
core +1 more source
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games [PDF]
, 2010 In this note we show that the asymmetric Prover–Delayer game developed in Beyersdorff et al. (2010) [2] for Parameterized Resolution is also applicable to other tree-like proof systems.
Atserias +10 more
core +2 more sources