Please use this identifier to cite or link to this item:
https://dspace.ctu.edu.vn/jspui/handle/123456789/100871
Title: | On the maximum independent set problem in graphs of bounded maximum degree |
Authors: | Lê, Ngọc C Tran, Trung |
Keywords: | Maximum independent set Stable set Low degree graph |
Issue Date: | 2020 |
Series/Report no.: | Acta mathematica Vietnamica journal;Vol.45, No.02 .- P.463-475 |
Abstract: | We consider the maximum independent set (MIS) problem, i.e., the problem asking for a vertex subset of maximum cardinality of a graph such that no two vertices in this set are adjacent. The problem is known to be NP-hard in general, even if restricted on graphs of maximum degree at most Δ for a given integer Δ ≥ 3, i.e., every vertex is of degree at most Δ. We try to figure out some bounded maximum degree graph classes, under which the problem can be solved in polynomial time. |
URI: | https://dspace.ctu.edu.vn/jspui/handle/123456789/100871 |
ISSN: | 0251-4184 |
Appears in Collections: | Acta Mathematica Vietnamica |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
_file_ Restricted Access | 2.11 MB | Adobe PDF | ||
Your IP: 52.15.209.178 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.