Generalized coloring for tree-like graphs
Identifieur interne : 002C30 ( Main/Exploration ); précédent : 002C29; suivant : 002C31Generalized coloring for tree-like graphs
Auteurs : Klaus Jansen ; Petra SchefflerSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1993.
Abstract
Abstract: We discuss the Precoloring Extension (PrExt) and the List Coloring (LiCol) problems for trees, partial k-trees and cographs in the decision and the construction versions. Both problems for partial k-trees are solved in linear time, when the number of colors is a constant and by O(¦V¦k+2)-algorithmsin general. For trees, we improve this to linear time. In contrast to that, PrExt and LiCol differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. We give polynomial algorithms for the corresponding enumeration problems #PrExt and #LiCol on partial k-trees and trees and for #PrExt on cographs.
Url:
DOI: 10.1007/3-540-56402-0_35
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001217
- to stream Istex, to step Curation: 001105
- to stream Istex, to step Checkpoint: 001334
- to stream Main, to step Merge: 003181
- to stream Main, to step Curation: 002C30
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Generalized coloring for tree-like graphs</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author><author><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3E9846C912FEE9031CD8FB91675A3364530B426E</idno><date when="1993" year="1993">1993</date><idno type="doi">10.1007/3-540-56402-0_35</idno><idno type="url">https://api.istex.fr/document/3E9846C912FEE9031CD8FB91675A3364530B426E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001217</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001217</idno><idno type="wicri:Area/Istex/Curation">001105</idno><idno type="wicri:Area/Istex/Checkpoint">001334</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001334</idno><idno type="wicri:doubleKey">0302-9743:1993:Jansen K:generalized:coloring:for</idno><idno type="wicri:Area/Main/Merge">003181</idno><idno type="wicri:Area/Main/Curation">002C30</idno><idno type="wicri:Area/Main/Exploration">002C30</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Generalized coloring for tree-like graphs</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation><wicri:noCountry code="subField">Trier</wicri:noCountry></affiliation></author><author><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name><affiliation><wicri:noCountry code="subField">12</wicri:noCountry></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1993</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">3E9846C912FEE9031CD8FB91675A3364530B426E</idno><idno type="DOI">10.1007/3-540-56402-0_35</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 discuss the Precoloring Extension (PrExt) and the List Coloring (LiCol) problems for trees, partial k-trees and cographs in the decision and the construction versions. Both problems for partial k-trees are solved in linear time, when the number of colors is a constant and by O(¦V¦k+2)-algorithmsin general. For trees, we improve this to linear time. In contrast to that, PrExt and LiCol differ in complexity for cographs. While the first has a linear algorithm, the second is shown NP-complete. We give polynomial algorithms for the corresponding enumeration problems #PrExt and #LiCol on partial k-trees and trees and for #PrExt on cographs.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><name sortKey="Scheffler, Petra" sort="Scheffler, Petra" uniqKey="Scheffler P" first="Petra" last="Scheffler">Petra Scheffler</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002C30 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002C30 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3E9846C912FEE9031CD8FB91675A3364530B426E
|texte= Generalized coloring for tree-like graphs
}}
| This area was generated with Dilib version V0.6.31. |  |