An Exact Exponential Time Algorithm for Power Dominating Set

The Power Dominating Set problem is an extension of the well-known domination problem on graphs in a way that we enrich it by a second propagation rule: given a graph G ( V , E ), a set P ⊆ V is a power dominating set if every vertex is observed after the exhaustive application of the following two...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 63; číslo 1-2; s. 323 - 346
Hlavní autoři:	Binkele-Raible, Daniel, Fernau, Henning
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.06.2012 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Theoretical computing Theory of Computation Measure and conquer Domination-type problems Moderately exponential time algorithms hardness results Dominating set Cubic graph Algorithmics Pointer Graph theory NP-hardness results NP hard problem Problem solving Subgraph Search tree Non local theory
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	The Power Dominating Set problem is an extension of the well-known domination problem on graphs in a way that we enrich it by a second propagation rule: given a graph G ( V , E ), a set P ⊆ V is a power dominating set if every vertex is observed after the exhaustive application of the following two rules. First, a vertex is observed if v ∈ P or it has a neighbor in P . Secondly, if an observed vertex has exactly one unobserved neighbor u , then also u will be observed, as well. We show that Power Dominating Set remains -hard on cubic graphs. We design an algorithm solving this problem in time on general graphs, using polynomial space only. To achieve this, we introduce so-called reference search trees that can be seen as a compact representation of usual search trees, providing non-local pointers in order to indicate pruned subtrees.
AbstractList	The Power Dominating Set problem is an extension of the well-known domination problem on graphs in a way that we enrich it by a second propagation rule: given a graph G ( V , E ), a set P ⊆ V is a power dominating set if every vertex is observed after the exhaustive application of the following two rules. First, a vertex is observed if v ∈ P or it has a neighbor in P . Secondly, if an observed vertex has exactly one unobserved neighbor u , then also u will be observed, as well. We show that Power Dominating Set remains -hard on cubic graphs. We design an algorithm solving this problem in time on general graphs, using polynomial space only. To achieve this, we introduce so-called reference search trees that can be seen as a compact representation of usual search trees, providing non-local pointers in order to indicate pruned subtrees.
Author	Fernau, Henning Binkele-Raible, Daniel
Author_xml	– sequence: 1 givenname: Daniel surname: Binkele-Raible fullname: Binkele-Raible, Daniel organization: FB 4—Abteilung Informatik/Wirtschaftsinformatik, Universität Trier – sequence: 2 givenname: Henning surname: Fernau fullname: Fernau, Henning email: fernau@informatik.uni-trier.de organization: FB 4—Abteilung Informatik/Wirtschaftsinformatik, Universität Trier
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25557217$$DView record in Pascal Francis
BookMark	eNp9kE1LAzEQhoNUsK3-AG978RjNJJvNLngptX5AQcF6XrJpUlN2k5JE1H9vSsWDh15mLu_zDvNM0Mh5pxG6BHINhIibSEjJGSYAuOGMYXqCxlAyigkvYYTGBESNywrEGZrEuCUEqGiqMbqduWLxJVXKc5crXbKyL1Z20MWs3_hg0_tQGB-KF_-pQ3HnB-tksm5TvOp0jk6N7KO--N1T9Ha_WM0f8fL54Wk-W2LFoE5Y1kRWVVmvmdCqy3fBaNLVnEowjda14NQwAF4STZuuI6SDqtNaNWvGeG1KNkVXh96djEr2JkinbGx3wQ4yfLeUcy4oiJyDQ04FH2PQ5i8CpN1rag-a2qyp3WtqaWbEP0bZlD_0LgVp-6MkPZAxX3EbHdqt_wguizgC_QDnc3yL
CitedBy_id	crossref_primary_10_1007_s10878_014_9785_2 crossref_primary_10_1016_j_tcs_2012_12_003 crossref_primary_10_1111_exsy_12559 crossref_primary_10_1007_s00453_024_01283_8 crossref_primary_10_1016_j_ejor_2014_12_047
Cites_doi	10.1016/j.ijepes.2005.05.005 10.1137/06066672X 10.1007/s00453-007-9145-z 10.1137/S0895480103432556 10.1007/978-3-642-11266-9_56 10.1016/j.ipl.2004.10.003 10.1137/0132071 10.1007/11533719_83 10.1137/S0895480100375831 10.1007/978-3-540-77891-2_14 10.1016/0196-6774(86)90032-5 10.1016/j.ipl.2006.01.007 10.1016/j.tcs.2006.04.011 10.1007/978-3-540-92182-0_15 10.1007/s00453-007-9147-x 10.1007/978-3-642-11269-0_13 10.1002/jgt.3190120311 10.1007/978-3-642-16533-7 10.1145/1552285.1552286
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC 2011 2015 INIST-CNRS
Copyright_xml	– notice: Springer Science+Business Media, LLC 2011 – notice: 2015 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1007/s00453-011-9533-2
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1432-0541
EndPage	346
ExternalDocumentID	25557217 10_1007_s00453_011_9533_2
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION IQODW
ID	FETCH-LOGICAL-c318t-a80a6648d37ecb2791fe0b852a1f9ee8752f311540e29bb00b16beec9d3358f43
IEDL.DBID	RSV
ISICitedReferencesCount	13
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000299482700015&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0178-4617
IngestDate	Mon Jul 21 09:13:34 EDT 2025 Tue Nov 18 22:13:20 EST 2025 Sat Nov 29 03:45:24 EST 2025 Fri Feb 21 02:40:20 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1-2
Keywords	Measure and conquer Domination-type problems Moderately exponential time algorithms hardness results Dominating set Cubic graph Algorithmics Pointer Graph theory NP-hardness results NP hard problem Problem solving Subgraph Search tree Non local theory
Language	English
License	http://www.springer.com/tdm CC BY 4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c318t-a80a6648d37ecb2791fe0b852a1f9ee8752f311540e29bb00b16beec9d3358f43
PageCount	24
ParticipantIDs	pascalfrancis_primary_25557217 crossref_primary_10_1007_s00453_011_9533_2 crossref_citationtrail_10_1007_s00453_011_9533_2 springer_journals_10_1007_s00453_011_9533_2
PublicationCentury	2000
PublicationDate	2012-06-01
PublicationDateYYYYMMDD	2012-06-01
PublicationDate_xml	– month: 06 year: 2012 text: 2012-06-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York – name: Heidelberg
PublicationTitle	Algorithmica
PublicationTitleAbbrev	Algorithmica
PublicationYear	2012
Publisher	Springer-Verlag Springer
Publisher_xml	– name: Springer-Verlag – name: Springer
References	Fernau, Raible, Nakano, Rahman (CR4) 2008 Raible, Fernau, Hong, Nagamochi, Fukunaga (CR16) 2008 van Rooij, Bodlaender, Albers, Weil (CR20) 2008 Aazami, Stilp (CR1) 2009; 23 Fomin, Kratsch (CR6) 2010 Fomin, Grandoni, Kratsch (CR8) 2008; 52 Venugopal, Veilumuthu, Avila Theresa (CR22) 2010 CR7 Speckenmeyer (CR19) 1988; 3 Liao, Lee, Wang (CR14) 2005 CR9 Xu, Kang, Shan, Zhao (CR24) 2006; 359 Garey, Johnson (CR10) 1977; 32 CR23 Chandran, Grandoni (CR3) 2005; 93 Robson (CR18) 1986; 7 Guo, Niedermeier, Raible (CR11) 2008; 52 Fernau, Langer, Liedloff, Kneis, Kratsch, Raible, Rossmanith, Chen, Fomin (CR5) 2009 Peng, Sun, Wang (CR15) 2006; 28 van Rooij, Nederlof, van Dijk, Fiat, Sanders (CR21) 2009 Brueni, Heath (CR2) 2006; 19 Raible, Fernau, van Leeuwen, Muscholl, Peleg, Pokorný, Rumpe (CR17) 2010 Kneis, Mölle, Richter, Rossmanith (CR13) 2006; 98 Haynes, Hedetniemi, Hedetniemi, Henning (CR12) 2002; 15 C.-S. Liao (9533_CR14) 2005 J. Peng (9533_CR15) 2006; 28 F.V. Fomin (9533_CR8) 2008; 52 G. Venugopal (9533_CR22) 2010 T.W. Haynes (9533_CR12) 2002; 15 D. Raible (9533_CR16) 2008 J.M. Robson (9533_CR18) 1986; 7 G. Xu (9533_CR24) 2006; 359 9533_CR9 9533_CR23 9533_CR7 F.V. Fomin (9533_CR6) 2010 M.R. Garey (9533_CR10) 1977; 32 D.J. Brueni (9533_CR2) 2006; 19 L.S. Chandran (9533_CR3) 2005; 93 J. Guo (9533_CR11) 2008; 52 E. Speckenmeyer (9533_CR19) 1988; 3 A. Aazami (9533_CR1) 2009; 23 H. Fernau (9533_CR4) 2008 J.M.M. Rooij van (9533_CR21) 2009 H. Fernau (9533_CR5) 2009 D. Raible (9533_CR17) 2010 J.M.M. Rooij van (9533_CR20) 2008 J. Kneis (9533_CR13) 2006; 98
References_xml	– volume: 28 start-page: 223 issue: 4 year: 2006 end-page: 231 ident: CR15 article-title: Optimal PMU placement for full network observability using tabu search algorithm publication-title: Int. J. Electr. Power Energy Syst. doi: 10.1016/j.ijepes.2005.05.005 – volume: 23 start-page: 1382 issue: 3 year: 2009 end-page: 1399 ident: CR1 article-title: Approximation algorithms and hardness for domination with propagation publication-title: SIAM J. Discrete Math. doi: 10.1137/06066672X – volume: 52 start-page: 153 issue: 2 year: 2008 end-page: 166 ident: CR8 article-title: Solving connected dominating set faster than 2 publication-title: Algorithmica doi: 10.1007/s00453-007-9145-z – volume: 19 start-page: 744 year: 2006 end-page: 761 ident: CR2 article-title: The PMU placement problem publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480103432556 – start-page: 672 year: 2010 end-page: 684 ident: CR17 article-title: An amortized search tree analysis for - publication-title: SOFSEM 2010: Theory and Practice of Computer Science doi: 10.1007/978-3-642-11266-9_56 – volume: 93 start-page: 125 year: 2005 end-page: 131 ident: CR3 article-title: Refined memorization for vertex cover publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2004.10.003 – volume: 32 start-page: 826 issue: 4 year: 1977 end-page: 834 ident: CR10 article-title: The rectilinear Steiner tree problem is NP-complete publication-title: SIAM J. Appl. Math. doi: 10.1137/0132071 – start-page: 818 year: 2005 end-page: 828 ident: CR14 article-title: Power domination problem in graphs publication-title: Computing and Combinatorics doi: 10.1007/11533719_83 – ident: CR9 – volume: 15 start-page: 519 issue: 4 year: 2002 end-page: 529 ident: CR12 article-title: Domination in graphs applied to electric power networks publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480100375831 – start-page: 144 year: 2008 end-page: 156 ident: CR4 article-title: Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs publication-title: Workshop on Algorithms and Computation: WALCOM doi: 10.1007/978-3-540-77891-2_14 – volume: 7 start-page: 425 issue: 3 year: 1986 end-page: 440 ident: CR18 article-title: Algorithms for maximum independent sets publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90032-5 – volume: 98 start-page: 145 issue: 4 year: 2006 end-page: 149 ident: CR13 article-title: Parameterized power domination complexity publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2006.01.007 – volume: 359 start-page: 299 issue: 1–3 year: 2006 end-page: 305 ident: CR24 article-title: Power domination in block graphs publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2006.04.011 – start-page: 136 year: 2008 end-page: 147 ident: CR16 article-title: Power domination in (1.7548 ) using reference search trees publication-title: Algorithms and Computation doi: 10.1007/978-3-540-92182-0_15 – ident: CR7 – volume: 52 start-page: 177 issue: 2 year: 2008 end-page: 202 ident: CR11 article-title: Improved algorithms and complexity results for power domination in graphs publication-title: Algorithmica doi: 10.1007/s00453-007-9147-x – start-page: 67 year: 2010 end-page: 71 ident: CR22 article-title: Optimal PMU placement and observability of power system using PSAT publication-title: International Joint Journal Conference on Engineering and Technology (IJJCET10) – start-page: 161 year: 2009 end-page: 172 ident: CR5 article-title: An exact algorithm for the maximum leaf spanning tree problem publication-title: International Workshop on Parameterized and Exact Computation (IWPEC) doi: 10.1007/978-3-642-11269-0_13 – volume: 3 start-page: 405 year: 1988 end-page: 412 ident: CR19 article-title: On feedback vertex sets and nonseparating independent sets in cubic graphs publication-title: J. Graph Theory doi: 10.1002/jgt.3190120311 – start-page: 554 year: 2009 end-page: 565 ident: CR21 article-title: Inclusion/exclusion meets measure and conquer publication-title: European Symposium on Algorithms (ESA) – ident: CR23 – start-page: 657 year: 2008 end-page: 668 ident: CR20 article-title: Design by measure and conquer, a faster exact algorithm for dominating set publication-title: Symposium on Theoretical Aspects of Computer Science (STACS) – year: 2010 ident: CR6 publication-title: Exact Exponential Algorithms. Texts in Theoretical Computer Science doi: 10.1007/978-3-642-16533-7 – volume: 28 start-page: 223 issue: 4 year: 2006 ident: 9533_CR15 publication-title: Int. J. Electr. Power Energy Syst. doi: 10.1016/j.ijepes.2005.05.005 – ident: 9533_CR7 – ident: 9533_CR23 – ident: 9533_CR9 doi: 10.1145/1552285.1552286 – volume: 32 start-page: 826 issue: 4 year: 1977 ident: 9533_CR10 publication-title: SIAM J. Appl. Math. doi: 10.1137/0132071 – volume: 3 start-page: 405 year: 1988 ident: 9533_CR19 publication-title: J. Graph Theory doi: 10.1002/jgt.3190120311 – volume: 98 start-page: 145 issue: 4 year: 2006 ident: 9533_CR13 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2006.01.007 – start-page: 818 volume-title: Computing and Combinatorics year: 2005 ident: 9533_CR14 doi: 10.1007/11533719_83 – volume: 52 start-page: 177 issue: 2 year: 2008 ident: 9533_CR11 publication-title: Algorithmica doi: 10.1007/s00453-007-9147-x – volume: 359 start-page: 299 issue: 1–3 year: 2006 ident: 9533_CR24 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2006.04.011 – start-page: 554 volume-title: European Symposium on Algorithms (ESA) year: 2009 ident: 9533_CR21 – start-page: 161 volume-title: International Workshop on Parameterized and Exact Computation (IWPEC) year: 2009 ident: 9533_CR5 doi: 10.1007/978-3-642-11269-0_13 – volume: 15 start-page: 519 issue: 4 year: 2002 ident: 9533_CR12 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480100375831 – volume-title: Exact Exponential Algorithms. Texts in Theoretical Computer Science year: 2010 ident: 9533_CR6 doi: 10.1007/978-3-642-16533-7 – start-page: 672 volume-title: SOFSEM 2010: Theory and Practice of Computer Science year: 2010 ident: 9533_CR17 doi: 10.1007/978-3-642-11266-9_56 – start-page: 657 volume-title: Symposium on Theoretical Aspects of Computer Science (STACS) year: 2008 ident: 9533_CR20 – volume: 23 start-page: 1382 issue: 3 year: 2009 ident: 9533_CR1 publication-title: SIAM J. Discrete Math. doi: 10.1137/06066672X – start-page: 67 volume-title: International Joint Journal Conference on Engineering and Technology (IJJCET10) year: 2010 ident: 9533_CR22 – volume: 19 start-page: 744 year: 2006 ident: 9533_CR2 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480103432556 – start-page: 136 volume-title: Algorithms and Computation year: 2008 ident: 9533_CR16 doi: 10.1007/978-3-540-92182-0_15 – volume: 7 start-page: 425 issue: 3 year: 1986 ident: 9533_CR18 publication-title: J. Algorithms doi: 10.1016/0196-6774(86)90032-5 – volume: 52 start-page: 153 issue: 2 year: 2008 ident: 9533_CR8 publication-title: Algorithmica doi: 10.1007/s00453-007-9145-z – start-page: 144 volume-title: Workshop on Algorithms and Computation: WALCOM year: 2008 ident: 9533_CR4 doi: 10.1007/978-3-540-77891-2_14 – volume: 93 start-page: 125 year: 2005 ident: 9533_CR3 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2004.10.003
SSID	ssj0012796
Score	2.021927
Snippet	The Power Dominating Set problem is an extension of the well-known domination problem on graphs in a way that we enrich it by a second propagation rule: given...
SourceID	pascalfrancis crossref springer
SourceType	Index Database Enrichment Source Publisher
StartPage	323
SubjectTerms	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Mathematics of Computing Theoretical computing Theory of Computation
Title	An Exact Exponential Time Algorithm for Power Dominating Set
URI	https://link.springer.com/article/10.1007/s00453-011-9533-2
Volume	63
WOSCitedRecordID	wos000299482700015&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: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5SPQhifWJ9lBw8KYHNYzdZ8FK0xYOUQlV6W5LdrBZ0W7qr-POdbHcXig_QS05JCJNMZob5Zj6Ezo0SieCMQ5Dj-URIGxCjLSdGUpHIkky6LBS-k8OhmkzCUVXHnddo9zolWf7UTbGb8z4c9oe6lCMn8O-u-67ZjAvRx49N6oDJkpTL0c4TAfa5TmV-t8WKMdqa6xzkki4JLb5kRkuDM2j_66g7aLvyL3Fv-SB20ZrN9lC75m7AlSrvo6tehvsfOi5gnM8yhxmCZa4gBPdenmaLafH8isGhxSNHo4ZvZg4y4yDSeGyLA_Qw6N9f35KKSYHEoLMF0crTQSBUwqWNDUiIptYzymeapqG1ELOw1LXdEZ5loQFNNDQw1sZhwrmvUsEPUSuDsxwhTEPFNeVBopNQJDQ0NKZW-JYHUnPFaAd5tUijuGoz7tguXqKmQXIpnQikEznpRKyDLpol82WPjd8md1fuqVkBsZEP4azsoMv6UqJKH_Oftzv-0-wTtAkOE1tCxU5Rq1i82TO0Eb8X03zRLd_hJw-11CI
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA6igoJYn1gfNQdPSmDz2E0WvBRtqVhLoVV6W5LdrBZqW7qr-PNN9gXFB-glpySESSYzw3wzHwAXSrCIUUJNkOO4iHHtISU1RYpjFvGMTDorFO7yXk-MRn6_qONOSrR7mZLMfuqq2M16Hxb7g23KkSLz764xy7JjQ_TBU5U6IDwj5bK084gZ-1ymMr_bYskYbc1lYuQS54QWXzKjmcFp1_511B2wXfiXsJk_iF2woqd7oFZyN8BClffBdXMKWx8yTM04n00tZsgsswUhsDl5ni3G6csrNA4t7FsaNXg7s5AZC5GGA50egMd2a3jTQQWTAgqNzqZICkd6HhMR5TpURkI41o4SLpE49rU2MQuJbdsd5mjiK6OJCntK69CPKHVFzOghWJ2asxwBiH1BJaZeJCOfRdhXOMSauZp6XFJBcB04pUiDsGgzbtkuJkHVIDmTTmCkE1jpBKQOLqsl87zHxm-TG0v3VK0wsZFrwlleB1flpQSFPiY_b3f8p9nnYKMzfOgG3bve_QnYNM4TyWFjp2A1XbzpM7AevqfjZNHI3uQnCpjXBg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA5SRQSxPrE-ag6elNDNJvsCL8W2KJZSrEpvS7Kb1ULdLu0q_nwn-4LiA8TLnjIhTDI7M8w38yF0Ll0ecmYySHIMi3BH2UQKxYh0KA-djEw6axTuO4OBOx57w4LndFGi3cuSZN7ToKc0xWkrCaNW1fimIxGNA6K6_MgI_INXOSQyGtN1P3qqygimkxF0aQp6wsFXl2XN77ZYckybiViAjqKc3OJLlTRzPr36v4-9jbaKuBO384eyg1ZUvIvqJacDLkx8D121Y9z9EEEK32QWaywRiOlGEdyePs_mk_TlFUOgi4eaXg13ZhpKo6HTeKTSffTY6z5c35CCYYEEYMspEa4hbJu7IXNUIEFbNFKGdC1T0MhTCnIZM9LjeLihTE-ChUpqS6UCL2TMciPODlAthrMcIkw9lwnK7FCEHg-pJ2lAFbcUsx3BXJM2kFGq1w-K8eOaBWPqV4OTM-34oB1fa8c3G-iiEkny2Ru_LW4u3VklATmTBWmu00CX5QX5hZ0uft7u6E-rz9D6sNPz-7eDu2O0ATGVmaPJTlAtnb-pU7QWvKeTxbyZPc9PuMvf6g
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=An+Exact+Exponential+Time+Algorithm+for+Power+Dominating+Set&rft.jtitle=Algorithmica&rft.au=Binkele-Raible%2C+Daniel&rft.au=Fernau%2C+Henning&rft.date=2012-06-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=63&rft.issue=1-2&rft.spage=323&rft.epage=346&rft_id=info:doi/10.1007%2Fs00453-011-9533-2&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_011_9533_2
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon