Results 101 to 110 of about 262 (120)
A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees. [PDF]
Discrete Appl MathLappo E, Rosenberg NA.
europepmc +1 more source
THE SHAPE OF THE ONE-DIMENSIONAL PHYLOGENETIC LIKELIHOOD FUNCTION. [PDF]
Ann Appl Probab, 2017 Dinh V, Matsen FA.
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
The robustness of phylogenetic diversity indices to extinctions. [PDF]
J Math BiolManson K.
europepmc +1 more source
Properties of Labeling Methods for Determining Shortest Path Trees. [PDF]
J Res Natl Bur Stand (1977), 1981 Shier DR, Witzgall C.
europepmc +1 more source
Functions on adjacent vertex degrees of trees with given degree sequence
Open Mathematics, 2014 Wang Hua
doaj +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Applied Mathematical Sciences, 2021
In a graph G = (V,E), an independent set is a subset I of V (G) such that no two vertices in I are adjacent. A maximum independent set is an independent set of maximum size.
Jenq-Jong Lin, Min-Jen Jou, Qian-Yu Lin
semanticscholar +1 more source
In a graph G = (V,E), an independent set is a subset I of V (G) such that no two vertices in I are adjacent. A maximum independent set is an independent set of maximum size.
Jenq-Jong Lin, Min-Jen Jou, Qian-Yu Lin
semanticscholar +1 more source
Trees with the total domination number twice the distance-2 domination number
, 2021The distance between two vertices u and v in a graph equals the length of a shortest path from u to v. The distance-2 domination number of a graph G, denoted by γ2(G), is the minimum cardinality of a vertex subset where every vertex not belonging to the ...
Min-Jen Jou, Jenq-Jong Lin, Qian-Yu Lin
semanticscholar +1 more source