Results 121 to 130 of about 996,556 (196)

Fortran Subroutines For Approximate Solution Of Maximum Independent Set Problems Using Grasp

open access: yes, 1999
. Let G = (V; E) be an undirected graph, where V and E are the sets of vertices and edges of G, respectively. A subset of the vertices S ` V is independent if all of its members are pairwise nonadjacent, i.e. have no edge between them.
Resende Feo, M. G. C. Resende
core  

Home - About - Disclaimer - Privacy