On hereditary efficiently dominatable graphs
Exploiting graph structure to cope with hard problems, Dagsthul seminar 11182, 01.05.11-06.05.11
Povzetek
On hereditary efficiently dominatable graphs
Ključne besede
perfect code;efficient domination;efficiently dominatable graph;polynomial time algorithm;
Podatki
| Jezik: | Angleški jezik |
|---|---|
| Leto izida: | 2011 |
| Tipologija: | 3.15 - Prispevek na konferenci brez natisa |
| Organizacija: | UP - Univerza na Primorskem |
| UDK: | 51 |
| COBISS: |
1024340052
|
| Št. ogledov: | 2935 |
| Št. prenosov: | 66 |
| Ocena: | 0 (0 glasov) |
| Metapodatki: |
|
Ostali podatki
| Sekundarni jezik: | Neznan jezik |
|---|---|
| Vrsta dela (COBISS): | Delo ni kategorizirano |
| ID: | 1493279 |
Priporočena dela:
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,
ni podatka o podnaslovu
Improved algorithms for k-domination and total k-domination in proper interval graphs
2018,
ni podatka o podnaslovu
ǂA ǂpolynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
2019,
ni podatka o podnaslovu
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
2019,
ni podatka o podnaslovu