Results 91 to 100 of about 4,009 (153)

Flip Distances Between Graph Orientations. [PDF]

open access: yesAlgorithmica, 2021
Aichholzer O   +6 more
europepmc   +1 more source

Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes. [PDF]

open access: yesJ Math Biol, 2021
Gross E   +5 more
europepmc   +1 more source

Improved Algorithms for White-Box Adversarial Streams. [PDF]

open access: yesProc Mach Learn Res, 2023
Feng Y, Woodruff DP.
europepmc   +1 more source

Matroid-reachability-based decomposition into arborescences

open access: yesDiscrete Applied Mathematics
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

Matroids, intersecting bases, and Borsuk property

open access: yes
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

Projective hypersurfaces in tropical scheme theory I: the Macaulay ideal. [PDF]

open access: yesRes Math Sci
Fink A   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy