|
New cases of polynomial solvability of the independent set problem for graphs with forbidden triods
S. V. Sorochan Lobachevsky Nizhny Novgorod State University, 23 Gagarin Avenue, 603950 Nizhny Novgorod, Russia
Keywords:
independent set, IS-easy class, IS-hard class, monotonic class, hereditary class, forbidden subgraph, triode, supergraph, polynomial algorithm.
Received: 31.08.2022 Revised: 03.11.2022 Accepted: 03.11.2022
Citation:
S. V. Sorochan, “New cases of polynomial solvability of the independent set problem for graphs with forbidden triods”, Diskretn. Anal. Issled. Oper., 30:1 (2023), 85–109
Linking options:
https://www.mathnet.ru/eng/da1317 https://www.mathnet.ru/eng/da/v30/i1/p85
|
Statistics & downloads: |
Abstract page: | 112 | Full-text PDF : | 9 | References: | 20 | First page: | 5 |
|