Results 131 to 140 of about 9,755 (179)
Phylogenetic Flexibility via Hall-Type Inequalities and Submodularity. [PDF]
Bull Math Biol, 2019 Huber KT, Moulton V, Steel M.
europepmc +1 more source
The Space of Equidistant Phylogenetic Cactuses. [PDF]
Ann CombHuber KT +4 more
europepmc +1 more source
Matroid theory and its applications
Zeitschrift für Operations Research, 1991 openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Network Coding and Matroid Theory
Proceedings of the IEEE, 2011Networks derived from matroids have played a fundamental role in proving theoretical results about the limits of network coding. In this tutorial paper, we review many connections between matroids and network coding theory, with specific emphasis on network solvability, admissible network alphabet sizes, linear coding, and network capacity.
R Dougherty, C Freiling, K Zeger
openaire +3 more sources
Transversal Theory and Matroids
Canadian Journal of Mathematics, 1969In this paper I use techniques developed by Mirsky and Perfect (5) to generalize the extremely close relationship between transversal theory and the theory of matroids or independence structures. I extend in two directions a fundamental theorem of Rado (8) and use the techniques of Mirsky and Perfect to obtain easy proofs of known and unknown results ...
openaire +2 more sources
1979
After our discussion of the basics of matroid theory in the previous chapter, we are now going to study in detail the most important classes of matroids: Linear matroids, binary and regular matroids, graphic and transversal matroids. The emphasis lies here on the characterization of these matroids and on applications to concrete combinatorial problems.
openaire +1 more source
After our discussion of the basics of matroid theory in the previous chapter, we are now going to study in detail the most important classes of matroids: Linear matroids, binary and regular matroids, graphic and transversal matroids. The emphasis lies here on the characterization of these matroids and on applications to concrete combinatorial problems.
openaire +1 more source
Proceedings 26th Annual International Computer Software and Applications, 2003
In order to acquire knowledge from databases, several methods of inductive learning, such as decision tree and rule induction, have been proposed. These methods are applied to discover meaningful knowledge from large databases, which shows they are useful.
openaire +1 more source
In order to acquire knowledge from databases, several methods of inductive learning, such as decision tree and rule induction, have been proposed. These methods are applied to discover meaningful knowledge from large databases, which shows they are useful.
openaire +1 more source