A Parameterized Perspective on Packing Paths of Length Two
Identifieur interne : 000588 ( Istex/Checkpoint ); précédent : 000587; suivant : 000589A Parameterized Perspective on Packing Paths of Length Two
Auteurs : Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: We study (vertex-disjoint) packings of paths of length two (i.e., of P 2’s) in graphs under a parameterized perspective. Starting from a maximal P 2-packing $\mathcal {P}$ of size j we use extremal combinatorial arguments for determining how many vertices of $\mathcal {P}$ appear in some P 2-packing of size (j + 1) (if it exists). We prove that one can ’reuse’ 2.5j vertices. Based on a WIN-WIN approach, we build an algorithm which decides if a P 2-packing of size at least k exists in a given graph in time ${\mathcal{O}}^*(2.482^{3k})$ .
Url:
DOI: 10.1007/978-3-540-85097-7_6
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:BDC5A3E742BD46ACA1AD40E5FC9D392A3D7ABF81Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Parameterized Perspective on Packing Paths of Length Two</title>
<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>
<author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:BDC5A3E742BD46ACA1AD40E5FC9D392A3D7ABF81</idno>
<date when="2008" year="2008">2008</date>
<idno type="doi">10.1007/978-3-540-85097-7_6</idno>
<idno type="url">https://api.istex.fr/document/BDC5A3E742BD46ACA1AD40E5FC9D392A3D7ABF81/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001808</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001808</idno>
<idno type="wicri:Area/Istex/Curation">001692</idno>
<idno type="wicri:Area/Istex/Checkpoint">000588</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000588</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Parameterized Perspective on Packing Paths of Length Two</title>
<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>Universität Trier, FB IV—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>
<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>Universität Trier, FB IV—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>
</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">BDC5A3E742BD46ACA1AD40E5FC9D392A3D7ABF81</idno>
<idno type="DOI">10.1007/978-3-540-85097-7_6</idno>
<idno type="ChapterID">6</idno>
<idno type="ChapterID">Chap6</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: We study (vertex-disjoint) packings of paths of length two (i.e., of P 2’s) in graphs under a parameterized perspective. Starting from a maximal P 2-packing $\mathcal {P}$ of size j we use extremal combinatorial arguments for determining how many vertices of $\mathcal {P}$ appear in some P 2-packing of size (j + 1) (if it exists). We prove that one can ’reuse’ 2.5j vertices. Based on a WIN-WIN approach, we build an algorithm which decides if a P 2-packing of size at least k exists in a given graph in time ${\mathcal{O}}^*(2.482^{3k})$ .</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"><region name="Rhénanie-Palatinat"><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name>
</region>
<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>
<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/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000588 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000588 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:BDC5A3E742BD46ACA1AD40E5FC9D392A3D7ABF81 |texte= A Parameterized Perspective on Packing Paths of Length Two }}
This area was generated with Dilib version V0.6.31. |