Results 111 to 120 of about 335 (183)
Matroidal Entropy Functions: A Quartet of Theories of Information, Matroid, Design, and Coding. [PDF]
Chen Q, Cheng M, Bai B.
europepmc +1 more source
The paper surveys recent results on algebraic matroids with the concentration on algebraic dependence over fields.
openaire +2 more sources
Non-Preemptive Tree Packing. [PDF]
Lendl S, Woeginger G, Wulf L.
europepmc +1 more source
Codes, matroids and derived matroids
This thesis first introduces some theory on coding theory and matroids, and properties that are shared between these, and then we will investigate derived matroids. In 1979 Longyear made a construction of derived matroids for binary matroids, which illuminates "dependencies among dependencies".
openaire +1 more source
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D so that A is adjacent to B but not to C, and D is adjacent to C but not to B. A graph is called matroidal if the binary relation “equals to or forms a couple with” among its edges is an equivalence relation. The structure of matroidal graphs is determined.
openaire +2 more sources
On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms. [PDF]
Yang Y, Chen PA, Lee YC, Fanchiang YY.
europepmc +1 more source
Idealness of k-wise intersecting families. [PDF]
Abdi A, Cornuéjols G, Huynh T, Lee D.
europepmc +1 more source
Efficient Allocation for Downlink Multi-Channel NOMA Systems Considering Complex Constraints. [PDF]
Xu Z, Petrunin I, Li T, Tsourdos A.
europepmc +1 more source
Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]
Fink A +3 more
europepmc +1 more source
Constant-competitiveness for random assignment Matroid secretary without knowing the Matroid. [PDF]
Santiago R, Sergeev I, Zenklusen R.
europepmc +1 more source

