On hereditary efficiently dominatable graphs
Exploiting graph structure to cope with hard problems, Dagsthul seminar 11182, 01.05.11-06.05.11
Abstract
On hereditary efficiently dominatable graphs
Keywords
perfect code;efficient domination;efficiently dominatable graph;polynomial time algorithm;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2011 |
| Typology: | 3.15 - Unpublished Conference Contribution |
| Organization: | UP - University of Primorska |
| UDC: | 51 |
| COBISS: |
1024340052
|
| Views: | 2935 |
| Downloads: | 66 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Unknown |
|---|---|
| Type (COBISS): | Not categorized |
| ID: | 1493279 |
Recommended works:
On hereditary efficiently dominatable graphs
2011,
Exploiting graph structure to cope with hard problems, Dagsthul seminar 11182, 01.05.11-06.05.11
On hereditary efficiently dominatable graphs
2011,
no subtitle data available
Improved algorithms for k-domination and total k-domination in proper interval graphs
2018,
no subtitle data available
ǂA ǂpolynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
2019,
no subtitle data available
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
2019,
no subtitle data available