Results 121 to 130 of about 4,009 (153)

Identifiability of Phylogenetic Level-2 Networks under the Jukes-Cantor Model

Englander AK, Frohn M, Gross E, Holtgrefe N, Van Iersel L, Jones M, Sullivant S.   +6 more
europepmc   +1 more source

Face enumeration on matroid base polytope

, 2018
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Bases of fuzzy matroids

Fuzzy Sets and Systems, 1989
The authors pursue their research on fuzzy matroids, a concept they introduced in a previous paper [see these authors, Fuzzy matroids, Fuzzy Sets and Systems 27, 291-302 (1988)]. They now deal with bases of fuzzy matroids. They show that not all matroids have fuzzy bases. They define a special class of fuzzy matroids that have them, called closed fuzzy
Goetschel, Roy jun., Voxman, William
openaire   +4 more sources

k-Best constrained bases of a matroid

ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research, 1990
Summary: We propose a method for finding a set of k-best bases of an arbitrary matroid where the bases are required to satisfy additional partitionlike constraints. An application of this problem is discussed.
Leclerc, Matthias, Rendl, Franz
openaire   +5 more sources

Decomposing symmetric exchanges in matroid bases

Mathematical Programming, 1976
Various exchange theorems have been established for the bases of a matroid [reviewer, Bull. Aust. Math. Soc. 1, 161--167 (1969; Zbl 0172.30703); \textit{Th. H. Brylawski}, Discrete Math. 6, 333--341 (1973; Zbl 0274.05004); \textit{C.Greene}, Proc. Am. Math. Soc. 397 45--50 (1973; Zbl 0267.05028); \textit{D. R. Woodal}, J. Comb. Theory, Ser.
openaire   +3 more sources

Bases in Infinite Matroids

Journal of the London Mathematical Society, 1991
Summary: We consider bases in matroids of infinite rank, and prove: (a) the existence of a perfect matching in the `transition graph' of any two bases. This is an extension of the existence of a non-zero generalized diagonal in the transition matrix between bases in finite dimensional linear spaces, and settles a conjecture of the second author [Math ...
Aharoni, Ron, Pouzet, Maurice
openaire   +2 more sources

The lattices of matroid bases and exact matroid bases

Archiv der Mathematik, 1991
Combinatorial objects are often associated with the polytope generated by the incidence vectors of the objects. The lattice of these incidence vectors is the set of all of their integer combinations. Such lattices are described if the objects are the bases of a matroid on \(E\), or only those bases which contain exactly \(p\) elements of a given subset
openaire   +1 more source

Bases and circuits of fuzzifying matroids

2018
Summary: In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievable example is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for the basis axioms and circuit axioms of crisp matroids respectively, are presented.
Yang, Shao-Jun, Shi, Fu-Gui
openaire   +1 more source

Matroid-Based Packing of Arborescences

SIAM Journal on Discrete Mathematics, 2013
We provide the directed counterpart of a slight extension of Katoh and Tanigawa's result [SIAM J. Discrete Math., 27 (2013), pp. 155--185] on rooted-tree decompositions with matroid constraints. Our result characterizes digraphs having a packing of arborescences with matroid constraints.
Durand de Gevigney, Olivier, Nguyen, Viet-Hang, Szigeti, Zoltán   +2 more
openaire   +1 more source