Results 51 to 60 of about 703 (75)

Discrete coalescent trees. [PDF]

J Math Biol, 2021
Collienne L, Collienne L, Elmes K, Fischer M, Bryant D, Gavryushkin A.   +5 more
europepmc   +1 more source

Computing the Tutte Polynomial on Graphs of Bounded Clique-Width

SIAM Journal on Discrete Mathematics, 2005
Omer Giménez, Petr Hliněný, M. Noy
semanticscholar   +1 more source

Super-polynomial approximation branching algorithms

RAIRO Oper. Res., 2016
B. Escoffier, V. Paschos, E. Tourniaire
semanticscholar   +1 more source

LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE

, 2018
K. A. Germina
semanticscholar   +1 more source

Finding H-partitions efficiently

RAIRO - Theoretical Informatics and Applications, 2005
S. Dantas, C. M. Figueiredo, Sylvain Gravier, S. Klein   +3 more
semanticscholar   +1 more source

RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]

Multiscale Model Simul, 2018
Heroy S, Taylor D, Shi FB, Forest MG, Mucha PJ.   +4 more
europepmc   +1 more source

A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]

Springerplus, 2016
Nagoor Gani A, Latha SR.
europepmc   +1 more source

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

Math Program, 2018
Fleszar K, Mnich M, Spoerhase J.
europepmc   +1 more source

FR3D: finding local and composite recurrent structural motifs in RNA 3D structures. [PDF]

J Math Biol, 2008
Sarver M, Zirbel CL, Stombaugh J, Mokdad A, Leontis NB.   +4 more
europepmc   +1 more source

Quantifying the difference between phylogenetic diversity and diversity indices. [PDF]

J Math Biol
Bordewich M, Semple C.
europepmc   +1 more source