Results 81 to 90 of about 116 (110)

The combinatorics of discrete time-trees: theory and open problems. [PDF]

open access: yesJ Math Biol, 2018
Gavryushkin A, Whidden C, Matsen FA.
europepmc   +1 more source

New algorithms for maximum disjoint paths based on tree-likeness. [PDF]

open access: yesMath Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves. [PDF]

open access: yesBull Math Biol, 2018
Janssen R   +4 more
europepmc   +1 more source

Gain-Sparsity and Symmetry-Forced Rigidity in the Plane. [PDF]

open access: yesDiscrete Comput Geom, 2016
Jordán T, Kaszanitzky VE, Tanigawa SI.
europepmc   +1 more source

[2020]Primary 05C25, 37B99; Secondary 05C12, 68R10

This paper introduces a hierarchy of contractive endomorphisms on graphs, providing a rigorous framework for quantitative structural compression. We first define a general class of (m,n)-contractive endomorphisms, which map paths of length m to walks of length at most n, and prove that they form a semigroup under composition. To analyze the dynamics of
zeinab Shahini, Madjid Eshaghi Gordji
openaire   +1 more source

Home - About - Disclaimer - Privacy