Mind the independence gap
Abstract
Mind the independence gap
Keywords
maximal independent set;independent dominating set;well-covered graph;hereditary independence gap;polynomial-time algorithm;NP-hard problem;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2020 |
| Typology: | 1.01 - Original Scientific Article |
| Organization: | UP - University of Primorska |
| UDC: | 519.17 |
| COBISS: |
15499267
|
| ISSN: | 0012-365X |
| Views: | 1438 |
| Downloads: | 57 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Secondary keywords: | maksimalna neodvisna množica;neodvisna dominantna množica;dobro pokrit graf;hereditarna neodvisnostna vrzel;NP-težek problem; |
| Pages: | str. 1-11 |
| Volume: | ǂVol. ǂ343 |
| Issue: | ǂiss. ǂ9 |
| Chronology: | 2020 |
| DOI: | 10.1016/j.disc.2020.111943 |
| ID: | 12098878 |
Recommended works:
Mind the independence gap
2020,
no subtitle data available
On Almost Well-Covered Graphs of Girth at Least 6
2018,
no subtitle data available
Strong cliques in diamond-free graphs
2021,
no subtitle data available
Strong cliques in diamond-free graphs
2020,
no subtitle data available
Chromatic numbers of strong product of odd cycles
2002,
no subtitle data available