Results 61 to 70 of about 703 (75)

Crossover operators for molecular graphs with an application to virtual drug screening. [PDF]

J Cheminform
Domschke N, Schmidt BJ, Gatter T, Golnik R, Eisenhuth P, Liessmann F, Meiler J, Stadler PF.   +7 more
europepmc   +1 more source

Better-than- 4 3 -approximations for leaf-to-leaf tree and connectivity augmentation. [PDF]

Math Program
Cecchetto F, Traub V, Zenklusen R.
europepmc   +1 more source

Diverse collections in matroids and graphs. [PDF]

Math Program
Fomin FV, Golovach PA, Panolan F, Philip G, Saurabh S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Parallel implementation of algorithms for finding connected components in graphs

Parallel Algorithms, 1994
T. Hsu, V. Ramachandran, N. Dean
semanticscholar   +1 more source

Optimization of persistent land coverage by swarm of drones

, 2018
Z. R. Bogdanowicz
semanticscholar   +1 more source

Algorithms for weighted domination number and weighted independent domination number of a tree

, 2018
Min-Jen Jou, Jenq-Jong Lin
semanticscholar   +1 more source

Algorithms for generating all the maximal independent sets of some graphs

, 2018
Min-Jen Jou, Jenq-Jong Lin
semanticscholar   +1 more source

Recurrence relation on the number of spanning trees of generalized book graphs and related family of graphs

, 2016
N. Narayana
semanticscholar   +1 more source

On vertex coloring of graphs

, 2015
V. Yegnanarayanan, B. Logeshwary
semanticscholar   +1 more source

Formula for the number of spanning trees in light graph

, 2014
Hajar Sahbani, M. E. Marraki
semanticscholar   +1 more source