Fong, Wan Heng and Salleh, Shaharuddin
(2004)
*A visual tool for determining the maximum independent set of a graph using the polynomial formulation method.*
Jurnal Teknologi, 41
.
pp. 65-72.

Full text not available from this repository.

## Abstract

Maximum independent set is a prototype problem in a graph theory that has many applications in engineering and science. In this paper, we study the problem of determining the largest number of maximum independent sets of a graph G (V, E) of order n using polynomial formulations. This method uses the first and second order neighbourhoods of nodes to determine whether a node is in the maximum independent set. This involves the maximization of an n-variable polynomial, where n is the number of nodes in G. Finally, we present a visual tool developed using the Visual C++ programming language for solving the maximum independent set problem.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | independent set, polynomial formulation, second-order neighbourhood. |

Subjects: | T Technology > T Technology (General) |

Divisions: | Science |

ID Code: | 12885 |

Deposited By: | S.N.Shahira Dahari |

Deposited On: | 06 Jul 2011 01:48 |

Last Modified: | 06 Jul 2011 01:48 |

Repository Staff Only: item control page