More Results on the Complexity of Domination Problems in Graphs

Olivier Hudry; Antoine Lobstein

doi:10.1504/ijicot.2017.083829

Journal Articles International Journal of Information and Coding Theory Year : 2017

More Results on the Complexity of Domination Problems in Graphs

(1) , (2)

1
2

Olivier Hudry

Function : Author
PersonId : 176850
IdHAL : olivier-hudry
ORCID : 0000-0002-5132-3024

Télécom ParisTech

Antoine Lobstein

Function : Author
PersonId : 15262
IdHAL : antoine-lobstein
IdRef : 029411696

Graphes, Algorithmes et Combinatoire (LRI)

Keywords

NP-completeness polynomial hierarchy. complexity complexity classes covering radius dominating codes graph theory hardness

Domains

Mathematics [math] Computer Science [cs]

Antoine Lobstein : Connect in order to contact the contributor

https://hal.science/hal-01593750

Submitted on : Tuesday, September 26, 2017-4:23:49 PM

Last modification on : Friday, March 24, 2023-2:53:05 PM

Dates and versions

hal-01593750 , version 1 (26-09-2017)

Identifiers

HAL Id : hal-01593750 , version 1
DOI : 10.1504/ijicot.2017.083829

Cite

Olivier Hudry, Antoine Lobstein. More Results on the Complexity of Domination Problems in Graphs. International Journal of Information and Coding Theory, 2017, 4 (2/3), pp.129-144. ⟨10.1504/ijicot.2017.083829⟩. ⟨hal-01593750⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

INSTITUT-TELECOM CNRS INSMI PARISTECH UMR8623 CENTRALESUPELEC LRI-GALAC UNIV-PARIS-SACLAY LTCI INFRES LISN GS-ENGINEERING GS-COMPUTER-SCIENCE LISN-GALAC C2

227 View

0 Download

More Results on the Complexity of Domination Problems in Graphs

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share