Solving the MDBCS Problem Using the Metaheuric–Genetic Algorithm

The problems degree-limited graph of nodes considering the weight of the vertex or weight of the edges, with the aim to find the optimal weighted graph in terms of certain restrictions on the degree of the vertices in the subgraph. This class of combinatorial problems was extensively studied because...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of advanced computer science & applications 2011, Vol.2 (12)
1. Verfasser:	Bogdanovic, Milena
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorial analysis Complexity Genetic algorithms Graph theory Heuristic Heuristic methods Network design Nodes Optimization Polynomials
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!