Results 11 to 20 of about 69,347 (192)
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least one horizontal
Marc Hellmuth +2 more
doaj +1 more source
On the heapability of finite partial orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
János Balogh +4 more
doaj +1 more source
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications.
Alexandre Bazin +3 more
doaj +1 more source
The agreement distance of unrooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and ...
Jonathan Klawitter
doaj +1 more source
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
Taking-and-merging games as rewrite games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules.
Eric Duchêne +3 more
doaj +1 more source
Stable gonality is computable [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number
Ragnar Groot Koerkamp +1 more
doaj +1 more source
The Principle of Mathematical Induction: Applications in Physical Optics
Journal of Applied Mathematics, 2022 The bare rudiments of the principle of mathematical induction as a method of proof date back to ancient times. In the contemporary university milieu, the demonstrative scheme is taught as part of a course in discrete mathematics, set theory, number ...
Joseph Ivin Thomas
doaj +1 more source
The agreement distance of rooted phylogenetic networks [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance.
Jonathan Klawitter
doaj +1 more source
The Recurrence Relations in Teaching Students of Informatics
Informatics in Education, 2010 The topic ``Recurrence relations'' and its place in teaching students of Informatics is discussed in this paper. We represent many arguments about the importance, the necessity and the benefit of studying this subject by Informatics students.
Valentin P. BAKOEV
doaj +1 more source