1. Research UNE
  2. UNE
  3. Conference Publication
Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/53636
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBazgan, Cristinaen
dc.contributor.authorBrankovic, Ljiljanaen
dc.contributor.authorCasel, Katrinen
dc.contributor.authorFernau, Henningen
dc.date.accessioned2022-11-07T23:51:36Z-
dc.date.available2022-11-07T23:51:36Z-
dc.date.issued2020-06-15-
dc.identifier.citationDiscrete Applied Mathematics, v.280, p. 23-42en
dc.identifier.issn1872-6771en
dc.identifier.issn0166-218Xen
dc.identifier.urihttps://hdl.handle.net/1959.11/53636-
dc.description.abstract<p>We survey the most important results regarding the domination chain parameters, including the characterisation of the domination sequence, complexity of exact and parameterised algorithms, and approximation and inapproximability ratios. We provide a number of new results for the upper and lower irredundance and their complements, and a few results for other domination chain problems. In particular, we analyse the structure of maximum irredundant sets and we provide new bounds on the upper irredundance number. We show several approximability results for upper and lower irredundance and their complements on general graphs; all four problems remain NP-hard even on planar cubic graphs and APX-hard on cubic graphs. Finally, we give some results on everywhere dense graphs, and study some related extension problems.</p>en
dc.languageenen
dc.publisherElsevier BV, North-Hollanden
dc.relation.ispartofDiscrete Applied Mathematicsen
dc.titleDomination Chain: Characterisation, Classical Complexity, Parameterised Complexity and Approximabilityen
dc.typeConference Publicationen
dc.relation.conferenceCALDAM 2016: Conference on Algorithms and Discrete Applied Mathematicsen
dc.identifier.doi10.1016/j.dam.2019.10.005en
local.contributor.firstnameCristinaen
local.contributor.firstnameLjiljanaen
local.contributor.firstnameKatrinen
local.contributor.firstnameHenningen
local.profile.schoolSchool of Science and Technologyen
local.profile.emaillbrankov@une.edu.auen
local.output.categoryE1en
local.record.placeauen
local.record.institutionUniversity of New Englanden
local.date.conference18th - 20th February, 2016en
local.conference.placeThiruvanthapuram, Indiaen
local.publisher.placeAmsterdam, Netherlandsen
local.format.startpage23en
local.format.endpage42en
local.peerreviewedYesen
local.identifier.volume280en
local.title.subtitleCharacterisation, Classical Complexity, Parameterised Complexity and Approximabilityen
local.contributor.lastnameBazganen
local.contributor.lastnameBrankovicen
local.contributor.lastnameCaselen
local.contributor.lastnameFernauen
dc.identifier.staffune-id:lbrankoven
local.profile.orcid0000-0002-5056-4627en
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.profile.roleauthoren
local.identifier.unepublicationidune:1959.11/53636en
local.date.onlineversion2019-10-14-
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
dc.identifier.academiclevelAcademicen
local.title.maintitleDomination Chainen
local.relation.fundingsourcenoteDeutsche Forschungsgemeinschaft, Germany, grant FE 560/6-1en
local.output.categorydescriptionE1 Refereed Scholarly Conference Publicationen
local.conference.detailsCALDAM 2016: Conference on Algorithms and Discrete Applied Mathematics, Thiruvanthapuram, India, 18th - 20th February, 2016en
local.search.authorBazgan, Cristinaen
local.search.authorBrankovic, Ljiljanaen
local.search.authorCasel, Katrinen
local.search.authorFernau, Henningen
local.uneassociationNoen
dc.date.presented2016-02-18-
local.atsiresearchNoen
local.conference.venueUniversity of Keralaen
local.sensitive.culturalNoen
local.identifier.wosid000531536000004en
local.year.available2019en
local.year.published2020en
local.year.presented2016en
local.fileurl.closedpublishedhttps://rune.une.edu.au/web/retrieve/75a36b64-f3d4-4408-8e9a-8112dd1d7f48en
local.subject.for2020461305 Data structures and algorithmsen
local.subject.seo2020229999 Other information and communication services not elsewhere classifieden
local.date.start2016-02-18-
local.date.end2016-02-20-
Appears in Collections:Conference Publication
School of Science and Technology
Files in This Item:
2 files
File Description SizeFormat 
Show simple item record

SCOPUSTM   
Citations

6
checked on Oct 5, 2024

Page view(s)

412
checked on Mar 8, 2023

Download(s)

10
checked on Mar 8, 2023
Google Media

Google ScholarTM

Check

Altmetric


Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.