Results 81 to 90 of about 4,000 (161)

Idealness of k-wise intersecting families. [PDF]

open access: yesMath Program, 2022
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc   +1 more source

Generation of all randomizations using circuits. [PDF]

open access: yesAnn Inst Stat Math, 2023
Pesce E   +3 more
europepmc   +1 more source

Matroid bases with cardinality constraints on the intersection. [PDF]

open access: yesMath Program, 2022
Lendl S, Peis B, Timmermans V.
europepmc   +1 more source

Separating cocircuits in binary matroids

open access: yesLinear Algebra and its Applications, 1982
AbstractA cocircuit of a matroid is separating if deleting it leaves a separable matroid. We give an effecient algorithm which finds a separating cocircuit or a Fano minor in a binary matroid, thus proving constructively a theorem of Tutte. Using this algorithm and a new recursive characterization of bond matroids, we give a new method for testing ...
openaire   +2 more sources

Note on binary simplicial matroids

open access: yesDiscrete Mathematics, 1984
Binary simplicial matroids are characterized among binary matroids. Using lemma 2: ''A binary simplicial matroid has a base whose associated fundamental hypergraph is isomorphic to a simplicial hypergraph.'', and a previous characterization of simplicial hypergraphs.
openaire   +1 more source

Deep Learning for Glaucoma Detection and Identification of Novel Diagnostic Areas in Diverse Real-World Datasets. [PDF]

open access: yesTransl Vis Sci Technol, 2022
Noury E   +12 more
europepmc   +1 more source

Recognition Algorithms for Binary Signed-Graphic Matroids

open access: yes, 2012
This paper has been withdrawn by the authors due to a newly submitted ...
Pitsoulis, Leonidas   +1 more
openaire   +2 more sources

Provable randomized rounding for minimum-similarity diversification. [PDF]

open access: yesData Min Knowl Discov, 2022
Ordozgoiti B   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy