The Malatya Independent Set Algorithm is Optimum

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

Authors

Institutions

Publication Details

Journal
Computer Science
Published
2025-12-01
DOI
https://doi.org/10.53070/bbd.1776643
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Malatya Independent Set Algorithm is Optimum

Ali Karci
Computer Science
Advanced Graph Theory Research
article

The Malatya Independent Set Algorithm is Optimum

Ali Karci
article en

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

Computer ScienceVol. 10(2)
Inonu University (TR)
Openalex Percentile: Top 26%
Advanced Graph Theory Research
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Malatya Independent Set Algorithm is Optimum — Ali Karci · Computer Science (2025) | TGRS Research Map | TGRS