Results 91 to 100 of about 4,009 (153)
Flip Distances Between Graph Orientations. [PDF]
Aichholzer O +6 more
europepmc +1 more source
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]
Gross E +5 more
europepmc +1 more source
Improved Algorithms for White-Box Adversarial Streams. [PDF]
Feng Y, Woodruff DP.
europepmc +1 more source
Generalized Index Coding Problem and Discrete Polymatroids. [PDF]
Thomas A, Sundar Rajan B.
europepmc +1 more source
Matroid-reachability-based decomposition into arborescences
The problem of matroid-reachability-based packing of arborescences was solved by Király. Here we solve the corresponding decomposition problem that turns out to be more complicated. The result is obtained from the solution of the more general problem of matroid-reachability-based $(\ell,\ell')$-limited packing of arborescences where we are given a ...
Florian Hörsch +2 more
openaire +2 more sources
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. [PDF]
Bruggmann S, Zenklusen R.
europepmc +1 more source
Matroids, intersecting bases, and Borsuk property
A subset $S$ of $\mathbb R^d$ has the Borsuk property if it can be decomposed into at most $d+1$ parts of diameter smaller than $S$. This is an important geometric property, inspired by a conjecture of Borsuk from the 1930s, which has attracted considerable attention over the years.
López-Campos, Gyivan +2 more
openaire +2 more sources
Tight basis cycle representatives for persistent homology of large biological data sets. [PDF]
Aggarwal M, Periwal V.
europepmc +1 more source
An efficient characterization of submodular spanning tree games. [PDF]
Koh ZK, Sanità L.
europepmc +1 more source
Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]
Fink A +3 more
europepmc +1 more source

