๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Two fast tree-creation algorithms for genetic programming

โœ Scribed by Luke, S.


Book ID
111856865
Publisher
IEEE
Year
2000
Tongue
English
Weight
295 KB
Volume
4
Category
Article
ISSN
1089-778X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A fast algorithm for Steiner trees
โœ L. Kou; G. Markowsky; L. Berman ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s