Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
Identifieur interne : 009E88 ( Main/Exploration ); précédent : 009E87; suivant : 009E89Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
Auteurs : Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guérin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Abstract: We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most ΔG+1 colors.
Url:
DOI: 10.1007/3-540-40064-8_18
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002478
- to stream Istex, to step Curation: 002447
- to stream Istex, to step Checkpoint: 002141
- to stream Main, to step Merge: 00A469
- to stream PascalFrancis, to step Corpus: 000994
- to stream PascalFrancis, to step Curation: 000082
- to stream PascalFrancis, to step Checkpoint: 000997
- to stream Main, to step Merge: 00A603
- to stream Main, to step Curation: 009E88
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)</title><author><name sortKey="Gebremedhin, Assefaw Hadish" sort="Gebremedhin, Assefaw Hadish" uniqKey="Gebremedhin A" first="Assefaw Hadish" last="Gebremedhin">Assefaw Hadish Gebremedhin</name></author><author><name sortKey="Lassous, Isabelle Guerin" sort="Lassous, Isabelle Guerin" uniqKey="Lassous I" first="Isabelle Guérin" last="Lassous">Isabelle Guérin Lassous</name></author><author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name></author><author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9D208A6AC12239996BD98ECDAF86977B4AAFC779</idno><date when="2000" year="2000">2000</date><idno type="doi">10.1007/3-540-40064-8_18</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-Q7N54BFX-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002478</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002478</idno><idno type="wicri:Area/Istex/Curation">002447</idno><idno type="wicri:Area/Istex/Checkpoint">002141</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002141</idno><idno type="wicri:doubleKey">0302-9743:2000:Gebremedhin A:graph:coloring:on</idno><idno type="wicri:Area/Main/Merge">00A469</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:01-0035144</idno><idno type="wicri:Area/PascalFrancis/Corpus">000994</idno><idno type="wicri:Area/PascalFrancis/Curation">000082</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000997</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000997</idno><idno type="wicri:doubleKey">0302-9743:2000:Gebremedhin A:graph:coloring:on</idno><idno type="wicri:Area/Main/Merge">00A603</idno><idno type="wicri:Area/Main/Curation">009E88</idno><idno type="wicri:Area/Main/Exploration">009E88</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)</title><author><name sortKey="Gebremedhin, Assefaw Hadish" sort="Gebremedhin, Assefaw Hadish" uniqKey="Gebremedhin A" first="Assefaw Hadish" last="Gebremedhin">Assefaw Hadish Gebremedhin</name><affiliation wicri:level="1"><country xml:lang="fr">Norvège</country><wicri:regionArea>University of Bergen</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Norvège</country></affiliation></author><author><name sortKey="Lassous, Isabelle Guerin" sort="Lassous, Isabelle Guerin" uniqKey="Lassous I" first="Isabelle Guérin" last="Lassous">Isabelle Guérin Lassous</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>INRIA Rocquencourt</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LORIA & INRIA Lorraine</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name><affiliation wicri:level="1"><country xml:lang="fr">Norvège</country><wicri:regionArea>University of Bergen</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Norvège</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm complexity</term><term>Approximation algorithm</term><term>Computer theory</term><term>Graph colouring</term><term>Graph connectivity</term><term>Parallel algorithm</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme approximation</term><term>Algorithme parallèle</term><term>Coloration graphe</term><term>Complexité algorithme</term><term>Connectivité graphe</term><term>Informatique théorique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most ΔG+1 colors.</div></front></TEI><affiliations><list><country><li>France</li><li>Norvège</li></country></list><tree><country name="Norvège"><noRegion><name sortKey="Gebremedhin, Assefaw Hadish" sort="Gebremedhin, Assefaw Hadish" uniqKey="Gebremedhin A" first="Assefaw Hadish" last="Gebremedhin">Assefaw Hadish Gebremedhin</name></noRegion><name sortKey="Gebremedhin, Assefaw Hadish" sort="Gebremedhin, Assefaw Hadish" uniqKey="Gebremedhin A" first="Assefaw Hadish" last="Gebremedhin">Assefaw Hadish Gebremedhin</name><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name></country><country name="France"><noRegion><name sortKey="Lassous, Isabelle Guerin" sort="Lassous, Isabelle Guerin" uniqKey="Lassous I" first="Isabelle Guérin" last="Lassous">Isabelle Guérin Lassous</name></noRegion><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name><name sortKey="Lassous, Isabelle Guerin" sort="Lassous, Isabelle Guerin" uniqKey="Lassous I" first="Isabelle Guérin" last="Lassous">Isabelle Guérin Lassous</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 009E88 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 009E88 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:9D208A6AC12239996BD98ECDAF86977B4AAFC779
|texte= Graph Coloring on a Coarse Grained Multiprocessor (Extended Abstract)
}}
| This area was generated with Dilib version V0.6.33. |  |