New algorithm for near-maximum independent set and its upper bounds in claw-free graphs

dc.contributor.author	Karci, Ş.
dc.contributor.author	Ari, A.
dc.contributor.author	Karci, A.
dc.date.accessioned	2023-01-04T07:33:46Z
dc.date.available	2023-01-04T07:33:46Z
dc.date.issued	2022
dc.identifier.issn	13001884 (ISSN)
dc.identifier.uri	http://hdl.handle.net/11616/87297
dc.description.abstract	Recently, approximation solution methods are used for some problems of graphs. These are the minimum dominating set, maximum independent set, maximum clique, perfect matching, Hamiltonian circuit. In this study, the application of a polynomial method to the problem of finding maximum independent sets will be emphasized. At this aim, case studies on king graphs, which are one of the claw-free graphs, will be shown and analytical limit for the number of elements of the maximum independent set for clae-free graphs. © 2022 Gazi Universitesi Muhendislik-Mimarlik. All rights reserved.
dc.source	Journal of the Faculty of Engineering and Architecture of Gazi University
dc.title	New algorithm for near-maximum independent set and its upper bounds in claw-free graphs

Files in this item

Files	Size	Format	View
There are no files associated with this item.