The Malatya Independent Set Algorithm is Optimum

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Bilgisayar Bilimleri
Cilt: 10 Sayı: 2
The Malatya Independent Set Algorithm is Optimum

The Malatya Independent Set Algorithm is Optimum

Authors : Ali Karci

Pages : 179-185

Doi:10.53070/bbd.1776643

View : 96 | Download : 157

Publication Date : 2025-12-01

Article Type : Review Paper

Abstract :Malatya Independent Set Algorithm is a greedy based algorithm, since it uses the first Malatya Centrality algorithm to find the maximum independent set for given graph. The scope of this paper is to illustrate that Malatya Independent Set Algorithm is optimum, and its process takes place for removing minimum nodes from graph as possible as for each node selection step
Keywords : Malatya Centrality Algorithm, Malatya Independent Set Algorithm, Maximum Independent Set.

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.

Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2026