Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
Identifieur interne : 000045 ( LNCS/Extraction ); précédent : 000044; suivant : 000046Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
Auteurs : Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
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 we have applied the next two rules exhaustively. 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 $\mathcal{NP}$ -hard on cubic graphs. We designed an algorithm solving this problem in time $\mathcal{O}^*(1.7548^n)$ on general graphs. To achieve this we have used a new notion of search trees called reference search trees providing non-local pointers.
Url:
DOI: 10.1007/978-3-540-92182-0_15
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001A54
- to stream Istex, to step Curation: 001937
- to stream Istex, to step Checkpoint: 000536
- to stream Main, to step Merge: 001224
- to stream Main, to step Curation: 001122
- to stream Main, to step Exploration: 001122
Links to Exploration step
ISTEX:92735AC455C6D119BAA6FFA37C9229837804851CLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees</title>
<author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name>
</author>
<author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name>
<affiliation><country>Allemagne</country>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:92735AC455C6D119BAA6FFA37C9229837804851C</idno>
<date when="2008" year="2008">2008</date>
<idno type="doi">10.1007/978-3-540-92182-0_15</idno>
<idno type="url">https://api.istex.fr/document/92735AC455C6D119BAA6FFA37C9229837804851C/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001A54</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001A54</idno>
<idno type="wicri:Area/Istex/Curation">001937</idno>
<idno type="wicri:Area/Istex/Checkpoint">000536</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000536</idno>
<idno type="wicri:doubleKey">0302-9743:2008:Raible D:power:domination:in</idno>
<idno type="wicri:Area/Main/Merge">001224</idno>
<idno type="wicri:Area/Main/Curation">001122</idno>
<idno type="wicri:Area/Main/Exploration">001122</idno>
<idno type="wicri:Area/LNCS/Extraction">000045</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees</title>
<author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Univ. Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea>
<wicri:noRegion>54286, Trier</wicri:noRegion>
<wicri:noRegion>Trier</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
</affiliation>
</author>
<author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Univ. Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea>
<wicri:noRegion>54286, Trier</wicri:noRegion>
<wicri:noRegion>Trier</wicri:noRegion>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2008</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">92735AC455C6D119BAA6FFA37C9229837804851C</idno>
<idno type="DOI">10.1007/978-3-540-92182-0_15</idno>
<idno type="ChapterID">15</idno>
<idno type="ChapterID">Chap15</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">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 we have applied the next two rules exhaustively. 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 $\mathcal{NP}$ -hard on cubic graphs. We designed an algorithm solving this problem in time $\mathcal{O}^*(1.7548^n)$ on general graphs. To achieve this we have used a new notion of search trees called reference search trees providing non-local pointers.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Rhénanie-Palatinat</li>
</region>
<settlement><li>Trèves (Allemagne)</li>
</settlement>
<orgName><li>Université de Trèves</li>
</orgName>
</list>
<tree><country name="Allemagne"><noRegion><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name>
</noRegion>
<name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name>
<name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name>
<name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Extraction
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000045 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Extraction/biblio.hfd -nk 000045 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= LNCS |étape= Extraction |type= RBID |clé= ISTEX:92735AC455C6D119BAA6FFA37C9229837804851C |texte= Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees }}
This area was generated with Dilib version V0.6.31. |