Labeling algorithm for power domination problem of trees

•The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power domination problem on trees and presents a linear-time algorithm to solve it using the labeling method. In this paper, the power domination p...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied mathematics and computation Ročník 457; s. 128163
Hlavný autor: Lyu, Yijia
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 15.11.2023
Predmet:
ISSN:0096-3003
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract •The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power domination problem on trees and presents a linear-time algorithm to solve it using the labeling method. In this paper, the power domination problem on trees is studied and we give a linear-time algorithm to it by using the labeling method. Our algorithm is simpler and easier to understand than those in [3,7].
AbstractList •The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power domination problem on trees and presents a linear-time algorithm to solve it using the labeling method. In this paper, the power domination problem on trees is studied and we give a linear-time algorithm to it by using the labeling method. Our algorithm is simpler and easier to understand than those in [3,7].
ArticleNumber 128163
Author Lyu, Yijia
Author_xml – sequence: 1
  givenname: Yijia
  surname: Lyu
  fullname: Lyu, Yijia
  email: lvyijia2005@outlook.com
  organization: No. 2 High School of East China Normal University, Shanghai, China
BookMark eNp9j7tOwzAYRj0UibbwAGx-gYTfFxJHTKjiJkVigN3y5XdxlcSVHYF4e1KVmembzqdzNmQ1pQkJuWFQM2DN7aE2o6s5cFEzrlgjVmQN0DWVABCXZFPKAQDahsk1Ub2xOMRpT82wTznOnyMNKdNj-sZMfRrjZOaYJnrMyQ440hTonBHLFbkIZih4_bdb8v70-LF7qfq359fdQ185Lru5slJyx9uuW8SUs8phEBaUklYKy5RswHeLowte2JaHO-N9p4JoWg-dNWJL2PnV5VRKxqCPOY4m_2gG-hSrD3qJ1adYfY5dmPszg4vWV8Ssi4s4OfQxo5u1T_Ef-hd7Y2BO
Cites_doi 10.1137/S0895480100375831
10.2989/16073606.2014.981694
10.1109/59.260810
10.1007/s10878-014-9795-0
10.1016/j.dam.2005.08.006
10.1016/j.tcs.2019.12.013
10.1007/11533719_83
10.1016/j.dam.2012.03.007
ContentType Journal Article
Copyright 2023 Elsevier Inc.
Copyright_xml – notice: 2023 Elsevier Inc.
DBID AAYXX
CITATION
DOI 10.1016/j.amc.2023.128163
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
ExternalDocumentID 10_1016_j_amc_2023_128163
S0096300323003326
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
23M
4.4
457
4G.
5GY
6J9
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AATTM
AAXKI
AAXUO
ABAOU
ABFNM
ABFRF
ABJNI
ABMAC
ACDAQ
ACGFO
ACGFS
ACRLP
ADBBV
ADEZE
ADGUI
AEBSH
AEFWE
AEIPS
AEKER
AENEX
AFJKZ
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIGVJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
ARUGR
AXJTR
BKOJK
BLXMC
BNPGV
CS3
EBS
EFJIC
EO8
EO9
EP2
EP3
F5P
FDB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
IHE
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
RNS
ROL
RPZ
RXW
SBC
SDF
SDG
SES
SME
SPC
SPCBC
SSH
SSW
SSZ
T5K
TN5
WH7
X6Y
XPP
ZMT
~02
~G-
5VS
9DU
AAQXK
AAYWO
AAYXX
ABEFU
ABWVN
ABXDB
ACLOT
ACRPL
ACVFH
ADCNI
ADIYS
ADMUD
ADNMO
AEUPX
AFFNX
AFPUW
AGQPQ
AI.
AIGII
AIIUN
AKBMS
AKYEP
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EFLBG
EJD
FEDTE
FGOYB
G-2
HLZ
HMJ
HVGLF
HZ~
R2-
SEW
TAE
VH1
VOH
WUQ
~HD
ID FETCH-LOGICAL-c249t-b442c27990168cb8cef3b0884b43b18460d9281cfd3b72f5add98f367d09ba3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001023620900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0096-3003
IngestDate Sat Nov 29 07:26:48 EST 2025
Sun Apr 06 06:56:26 EDT 2025
IsPeerReviewed true
IsScholarly true
Keywords Trees
Power domination
Dominating set
05C85
05C05
Linear-time algorithm
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c249t-b442c27990168cb8cef3b0884b43b18460d9281cfd3b72f5add98f367d09ba3
ParticipantIDs crossref_primary_10_1016_j_amc_2023_128163
elsevier_sciencedirect_doi_10_1016_j_amc_2023_128163
PublicationCentury 2000
PublicationDate 2023-11-15
PublicationDateYYYYMMDD 2023-11-15
PublicationDate_xml – month: 11
  year: 2023
  text: 2023-11-15
  day: 15
PublicationDecade 2020
PublicationTitle Applied mathematics and computation
PublicationYear 2023
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
References Dorfling, Henning (bib0005) 2015; 38
Haynes, Hedetniemi, Hedetniemi, Henning (bib0003) 2002; 15
Mili, Baldwin, Phadke (bib0002) 1991
Baldwin, Mili, Boisen, Adapa (bib0001) 1993; 8
Chang, Dorbec, Montassier, Raspaud (bib0007) 2012; 160
Dorfling, Henning (bib0004) 2006; 154
Liao, Lee (bib0006) 2005; 3595
Garey, Johnson (bib0010) 1979
Cheng, Lu, Zhou (bib0008) 2020; 809
Wang, Chen, Lu (bib0009) 2016; 31
Liao (10.1016/j.amc.2023.128163_bib0006) 2005; 3595
Baldwin (10.1016/j.amc.2023.128163_bib0001) 1993; 8
Dorfling (10.1016/j.amc.2023.128163_bib0004) 2006; 154
Wang (10.1016/j.amc.2023.128163_bib0009) 2016; 31
Chang (10.1016/j.amc.2023.128163_bib0007) 2012; 160
Garey (10.1016/j.amc.2023.128163_bib0010) 1979
Mili (10.1016/j.amc.2023.128163_bib0002) 1991
Haynes (10.1016/j.amc.2023.128163_bib0003) 2002; 15
Dorfling (10.1016/j.amc.2023.128163_bib0005) 2015; 38
Cheng (10.1016/j.amc.2023.128163_bib0008) 2020; 809
References_xml – volume: 15
  start-page: 519
  year: 2002
  end-page: 529
  ident: bib0003
  article-title: Domination in graphs applied to electric power networks
  publication-title: SIAM J. Discrete Math.
– volume: 154
  start-page: 1023
  year: 2006
  end-page: 1027
  ident: bib0004
  article-title: A note on power domination in grid graphs
  publication-title: Discrete Appl. Math.
– volume: 809
  start-page: 231
  year: 2020
  end-page: 238
  ident: bib0008
  article-title: The
  publication-title: Theoret. Comput. Sci.
– volume: 3595
  start-page: 818
  year: 2005
  end-page: 828
  ident: bib0006
  article-title: Power domination problem in graphs
  publication-title: Lect. Notes Comput. Sci.
– volume: 31
  start-page: 865
  year: 2016
  end-page: 873
  ident: bib0009
  article-title: -Power domination in block graphs
  publication-title: J. Comb. Optim.
– volume: 38
  start-page: 155
  year: 2015
  end-page: 180
  ident: bib0005
  article-title: Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
  publication-title: Quaestiones Math.
– volume: 160
  start-page: 1691
  year: 2012
  end-page: 1698
  ident: bib0007
  article-title: Generalized power domination of graphs
  publication-title: Discrete Appl. Math.
– year: 1979
  ident: bib0010
  article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness
– volume: 8
  start-page: 707
  year: 1993
  end-page: 715
  ident: bib0001
  article-title: Power system observability with minimal phasor measurement placement
  publication-title: IEEE Trans. Power Syst.
– year: 1991
  ident: bib0002
  article-title: Phasor measurement placement for voltage and stability monitoring and control
  publication-title: Proceedings of the EPRI-NSF Workshop on Application of Advanced Mathematices to Power Systems, San Francisco, CA
– volume: 15
  start-page: 519
  year: 2002
  ident: 10.1016/j.amc.2023.128163_bib0003
  article-title: Domination in graphs applied to electric power networks
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/S0895480100375831
– volume: 38
  start-page: 155
  year: 2015
  ident: 10.1016/j.amc.2023.128163_bib0005
  article-title: Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
  publication-title: Quaestiones Math.
  doi: 10.2989/16073606.2014.981694
– volume: 8
  start-page: 707
  year: 1993
  ident: 10.1016/j.amc.2023.128163_bib0001
  article-title: Power system observability with minimal phasor measurement placement
  publication-title: IEEE Trans. Power Syst.
  doi: 10.1109/59.260810
– volume: 31
  start-page: 865
  year: 2016
  ident: 10.1016/j.amc.2023.128163_bib0009
  article-title: k-Power domination in block graphs
  publication-title: J. Comb. Optim.
  doi: 10.1007/s10878-014-9795-0
– volume: 154
  start-page: 1023
  year: 2006
  ident: 10.1016/j.amc.2023.128163_bib0004
  article-title: A note on power domination in grid graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2005.08.006
– volume: 809
  start-page: 231
  year: 2020
  ident: 10.1016/j.amc.2023.128163_bib0008
  article-title: The k-power domination problem in weighted trees
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2019.12.013
– volume: 3595
  start-page: 818
  year: 2005
  ident: 10.1016/j.amc.2023.128163_bib0006
  article-title: Power domination problem in graphs
  publication-title: Lect. Notes Comput. Sci.
  doi: 10.1007/11533719_83
– year: 1991
  ident: 10.1016/j.amc.2023.128163_bib0002
  article-title: Phasor measurement placement for voltage and stability monitoring and control
– year: 1979
  ident: 10.1016/j.amc.2023.128163_bib0010
– volume: 160
  start-page: 1691
  year: 2012
  ident: 10.1016/j.amc.2023.128163_bib0007
  article-title: Generalized power domination of graphs
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2012.03.007
SSID ssj0007614
Score 2.4093518
Snippet •The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 128163
SubjectTerms Dominating set
Linear-time algorithm
Power domination
Trees
Title Labeling algorithm for power domination problem of trees
URI https://dx.doi.org/10.1016/j.amc.2023.128163
Volume 457
WOSCitedRecordID wos001023620900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  issn: 0096-3003
  databaseCode: AIEXJ
  dateStart: 19950101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.sciencedirect.com
  omitProxy: false
  ssIdentifier: ssj0007614
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ1JS8QwFICDjh70IK44buTgSamMTaZpjiKKioqgh7mVJk10BqczzCL6733ZOuMGevASSmnTNF95ea95C0L7uSoky1kS5WAARVRykIOw0EVKcyUVT3STaFtsgt3epq0Wv_O1-Ya2nAAry_T1lff_FTWcA9gmdPYPuKtO4QQcA3RoATu0vwJ_nQsXY54_P_bA9H_qWlfCvimHdlj0jOuLZe5LyVgngYHyroQhH63XTbtVUtdhCIDrjz9u3l-_ja0Yb3fa-fQvhJiYWDoXRBnEIjcOcA0yLRapSxztBZvZcHOS6IvMdeZ_5yjvmpSQMTmaXPsxv_WndafyBgyOZp0MushMF5nrYhbNxazJ0xqaO7k8a11VSyxLXNL2MO6wXW0d9z6N43uFY0qJeFhGS177xyeO2gqaUeUqWryZzPIaSgM_XPHDwA9bfnjCD3t-uKex5beO7s_PHk4vIl_eIpJg844iQWksY2Y2JpNUilQqTQQIfSooEWB4J42CwxtIXRDBYt2ElYinmiSsaHCRkw1UK3ul2kSYaxKzRBXNY1lQwYu0oUD5EESKWIG9TuvoIMxA1nc5TLIf57yOaJijzCthTrnKgPfPt2395RnbaGHyGe6g2mgwVrtoXr6M2sPBnof9DgLcUMc
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Labeling+algorithm+for+power+domination+problem+of+trees&rft.jtitle=Applied+mathematics+and+computation&rft.au=Lyu%2C+Yijia&rft.date=2023-11-15&rft.issn=0096-3003&rft.volume=457&rft.spage=128163&rft_id=info:doi/10.1016%2Fj.amc.2023.128163&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_amc_2023_128163
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon