Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. Only few examples of classes are available, where the problem admits polynomial-time solutions. In the present paper, we extend the short list of such classes with two new examples. © 2017, Springer International Publishing AG
New results on weighted independent domination
Mosca, Raffaele;
2017-01-01
Abstract
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. Only few examples of classes are available, where the problem admits polynomial-time solutions. In the present paper, we extend the short list of such classes with two new examples. © 2017, Springer International Publishing AGFile in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
NewResultsonWeightedIndependentDomination.pdf
Solo gestori archivio
Tipologia:
PDF editoriale
Dimensione
304.89 kB
Formato
Adobe PDF
|
304.89 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
