Genetic Programming Based Degree Constrained Spanning Tree Extraction

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{Babar:2013:ICDIM,

• author = "Zaheer Babar and Muhammad Waqas and Zahid Halim and Muhammad Arshad Islam",
• booktitle = "Eighth International Conference on Digital Information Management (ICDIM 2013)",
• title = "Genetic Programming Based Degree Constrained Spanning Tree Extraction",
• year = "2013",
• month = sep,
• pages = "241--246",
• keywords = "genetic algorithms, genetic programming, Degree Constraint Spanning Tree, Spanning Tree, Minimum Spanning Tree, Cyclic Interchange",
• DOI = "doi:10.1109/ICDIM.2013.6693966",
• size = "6 pages",
• abstract = "The problem of extracting a degree constraint spanning tree deals with extraction of a spanning tree from a given graph. Where, the degree of each node is greater than or equal to a thread hold value. Genetic Programming is an evolution based strategy appropriate for optimisation problems. In this paper we propose a genetic programming based solution to the degree constraint spanning tree extraction. The individuals of the population are represented as a tree and mutation is applied as the only genetic operator for evaluation to occur. We have further tested our proposed solution on different graph and found it to be suitable for degree constraint spanning tree extraction problem.",
• notes = "Also known as \cite{6693966}",

}

Genetic Programming entries for Zaheer Babar Muhammad Waqas Zahid Halim Muhammad Arshad Islam

Citations