Results 51 to 60 of about 730 (100)
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +1 more source
The hybrid number of a ploidy profile. [PDF]
J Math Biol, 2022 Huber KT, Maher LJ.
europepmc +1 more source
A subquadratic triad census algorithm for large sparse networks with small maximum degree
Soc. Networks, 2001 V. Batagelj, Andrej Mrvar
semanticscholar +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 +3 more
semanticscholar +1 more source
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +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