Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Identifieur interne : 001596 ( Istex/Curation ); précédent : 001595; suivant : 001597Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
Auteurs : Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2008.
Abstract
Abstract: Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (one is exact, the other parameterized) for (1,n)-graphs, a class containing cubic graphs. The running times are $\mathcal{O}^*(1.1871^m)$ and $\mathcal{O}^*(1.212^k)$ , respectively, determined by an amortized analysis via a non-standard measure.
Url:
DOI: 10.1007/978-3-540-77891-2_14
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001709
Links to Exploration step
ISTEX:0B0A4966CAED3C135475930A4DB3E3CBBBDEF416Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><mods:affiliation>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: fernau@uni-trier.de</mods:affiliation><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name><affiliation wicri:level="1"><mods:affiliation>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: raible@uni-trier.de</mods:affiliation><country wicri:rule="url">Allemagne</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0B0A4966CAED3C135475930A4DB3E3CBBBDEF416</idno><date when="2008" year="2008">2008</date><idno type="doi">10.1007/978-3-540-77891-2_14</idno><idno type="url">https://api.istex.fr/document/0B0A4966CAED3C135475930A4DB3E3CBBBDEF416/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001709</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001709</idno><idno type="wicri:Area/Istex/Curation">001596</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs</title><author><name sortKey="Fernau, Henning" sort="Fernau, Henning" uniqKey="Fernau H" first="Henning" last="Fernau">Henning Fernau</name><affiliation wicri:level="1"><mods:affiliation>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: fernau@uni-trier.de</mods:affiliation><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Raible, Daniel" sort="Raible, Daniel" uniqKey="Raible D" first="Daniel" last="Raible">Daniel Raible</name><affiliation wicri:level="1"><mods:affiliation>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier, Germany</mods:affiliation><country xml:lang="fr">Allemagne</country><wicri:regionArea>Univ.Trier, FB 4—Abteilung Informatik, 54286, Trier</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: raible@uni-trier.de</mods:affiliation><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">0B0A4966CAED3C135475930A4DB3E3CBBBDEF416</idno><idno type="DOI">10.1007/978-3-540-77891-2_14</idno><idno type="ChapterID">14</idno><idno type="ChapterID">Chap14</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: Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (one is exact, the other parameterized) for (1,n)-graphs, a class containing cubic graphs. The running times are $\mathcal{O}^*(1.1871^m)$ and $\mathcal{O}^*(1.212^k)$ , respectively, determined by an amortized analysis via a non-standard measure.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001596 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001596 | 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= Curation
|type= RBID
|clé= ISTEX:0B0A4966CAED3C135475930A4DB3E3CBBBDEF416
|texte= Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
}}
| This area was generated with Dilib version V0.6.31. |  |