Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/53636
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bazgan, Cristina | en |
dc.contributor.author | Brankovic, Ljiljana | en |
dc.contributor.author | Casel, Katrin | en |
dc.contributor.author | Fernau, Henning | en |
dc.date.accessioned | 2022-11-07T23:51:36Z | - |
dc.date.available | 2022-11-07T23:51:36Z | - |
dc.date.issued | 2020-06-15 | - |
dc.identifier.citation | Discrete Applied Mathematics, v.280, p. 23-42 | en |
dc.identifier.issn | 1872-6771 | en |
dc.identifier.issn | 0166-218X | en |
dc.identifier.uri | https://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.language | en | en |
dc.publisher | Elsevier BV, North-Holland | en |
dc.relation.ispartof | Discrete Applied Mathematics | en |
dc.title | Domination Chain: Characterisation, Classical Complexity, Parameterised Complexity and Approximability | en |
dc.type | Conference Publication | en |
dc.relation.conference | CALDAM 2016: Conference on Algorithms and Discrete Applied Mathematics | en |
dc.identifier.doi | 10.1016/j.dam.2019.10.005 | en |
local.contributor.firstname | Cristina | en |
local.contributor.firstname | Ljiljana | en |
local.contributor.firstname | Katrin | en |
local.contributor.firstname | Henning | en |
local.profile.school | School of Science and Technology | en |
local.profile.email | lbrankov@une.edu.au | en |
local.output.category | E1 | en |
local.record.place | au | en |
local.record.institution | University of New England | en |
local.date.conference | 18th - 20th February, 2016 | en |
local.conference.place | Thiruvanthapuram, India | en |
local.publisher.place | Amsterdam, Netherlands | en |
local.format.startpage | 23 | en |
local.format.endpage | 42 | en |
local.peerreviewed | Yes | en |
local.identifier.volume | 280 | en |
local.title.subtitle | Characterisation, Classical Complexity, Parameterised Complexity and Approximability | en |
local.contributor.lastname | Bazgan | en |
local.contributor.lastname | Brankovic | en |
local.contributor.lastname | Casel | en |
local.contributor.lastname | Fernau | en |
dc.identifier.staff | une-id:lbrankov | en |
local.profile.orcid | 0000-0002-5056-4627 | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.profile.role | author | en |
local.identifier.unepublicationid | une:1959.11/53636 | en |
local.date.onlineversion | 2019-10-14 | - |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
dc.identifier.academiclevel | Academic | en |
local.title.maintitle | Domination Chain | en |
local.relation.fundingsourcenote | Deutsche Forschungsgemeinschaft, Germany, grant FE 560/6-1 | en |
local.output.categorydescription | E1 Refereed Scholarly Conference Publication | en |
local.conference.details | CALDAM 2016: Conference on Algorithms and Discrete Applied Mathematics, Thiruvanthapuram, India, 18th - 20th February, 2016 | en |
local.search.author | Bazgan, Cristina | en |
local.search.author | Brankovic, Ljiljana | en |
local.search.author | Casel, Katrin | en |
local.search.author | Fernau, Henning | en |
local.uneassociation | No | en |
dc.date.presented | 2016-02-18 | - |
local.atsiresearch | No | en |
local.conference.venue | University of Kerala | en |
local.sensitive.cultural | No | en |
local.identifier.wosid | 000531536000004 | en |
local.year.available | 2019 | en |
local.year.published | 2020 | en |
local.year.presented | 2016 | en |
local.fileurl.closedpublished | https://rune.une.edu.au/web/retrieve/75a36b64-f3d4-4408-8e9a-8112dd1d7f48 | en |
local.subject.for2020 | 461305 Data structures and algorithms | en |
local.subject.seo2020 | 229999 Other information and communication services not elsewhere classified | en |
local.date.start | 2016-02-18 | - |
local.date.end | 2016-02-20 | - |
Appears in Collections: | Conference Publication School of Science and Technology |
Files in This Item:
File | Description | Size | Format |
---|
SCOPUSTM
Citations
6
checked on Dec 21, 2024
Page view(s)
412
checked on Mar 8, 2023
Download(s)
10
checked on Mar 8, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.