Graph coloring on a coarse grained multiprocessor : (Extended abstract)
Identifieur interne :
000994 ( PascalFrancis/Corpus );
précédent :
000993;
suivant :
000995
Graph coloring on a coarse grained multiprocessor : (Extended abstract)
Auteurs : Assefaw Hadish Gebremedhin ;
Isabelle Guérin Lassous ;
Jens Gustedt ;
Jan Arne TelleSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2000.
RBID : Pascal:01-0035144
Descripteurs français
English descriptors
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.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 1928 |
|---|
| A08 | 01 | 1 | ENG | @1 Graph coloring on a coarse grained multiprocessor : (Extended abstract) |
|---|
| A09 | 01 | 1 | ENG | @1 Graph-theoretic concepts in computer science : Konstanz, 15-17 June 2000 |
|---|
| A11 | 01 | 1 | | @1 GEBREMEDHIN (Assefaw Hadish) |
|---|
| A11 | 02 | 1 | | @1 LASSOUS (Isabelle Guérin) |
|---|
| A11 | 03 | 1 | | @1 GUSTEDT (Jens) |
|---|
| A11 | 04 | 1 | | @1 TELLE (Jan Arne) |
|---|
| A12 | 01 | 1 | | @1 BRANDES (Ulrik) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 WAGNER (Dorothea) @9 ed. |
|---|
| A14 | 01 | | | @1 University of Bergen @3 NOR @Z 1 aut. @Z 4 aut. |
|---|
| A14 | 02 | | | @1 INRIA Rocquencourt @3 FRA @Z 2 aut. |
|---|
| A14 | 03 | | | @1 LORIA & INRIA Lorraine @3 FRA @Z 3 aut. |
|---|
| A20 | | | | @1 184-195 |
|---|
| A21 | | | | @1 2000 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-41183-6 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000092007920180 |
|---|
| A44 | | | | @0 0000 @1 © 2001 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 8 ref. |
|---|
| A47 | 01 | 1 | | @0 01-0035144 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 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. |
|---|
| C02 | 01 | X | | @0 001D02A06 |
|---|
| C03 | 01 | X | FRE | @0 Informatique théorique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Computer theory @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Informática teórica @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Complexité algorithme @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Algorithm complexity @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Complejidad algoritmo @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Algorithme parallèle @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Parallel algorithm @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Algoritmo paralelo @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Connectivité graphe @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Graph connectivity @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Conectividad grafo @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Coloration graphe @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Graph colouring @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Coloración grafo @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Algorithme approximation @4 CD @5 96 |
|---|
| C03 | 06 | X | ENG | @0 Approximation algorithm @4 CD @5 96 |
|---|
| N21 | | | | @1 022 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 WG 2000 : international workshop on graph theoretic concepts in computer science @2 26 @3 Konstanz DEU @4 2000-06-15 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 01-0035144 INIST |
|---|
| ET : | Graph coloring on a coarse grained multiprocessor : (Extended abstract) |
|---|
| AU : | GEBREMEDHIN (Assefaw Hadish); LASSOUS (Isabelle Guérin); GUSTEDT (Jens); TELLE (Jan Arne); BRANDES (Ulrik); WAGNER (Dorothea) |
|---|
| AF : | University of Bergen/Norvège (1 aut., 4 aut.); INRIA Rocquencourt/France (2 aut.); LORIA & INRIA Lorraine/France (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1928; Pp. 184-195; Bibl. 8 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | 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. |
|---|
| CC : | 001D02A06 |
|---|
| FD : | Informatique théorique; Complexité algorithme; Algorithme parallèle; Connectivité graphe; Coloration graphe; Algorithme approximation |
|---|
| ED : | Computer theory; Algorithm complexity; Parallel algorithm; Graph connectivity; Graph colouring; Approximation algorithm |
|---|
| SD : | Informática teórica; Complejidad algoritmo; Algoritmo paralelo; Conectividad grafo; Coloración grafo |
|---|
| LO : | INIST-16343.354000092007920180 |
|---|
| ID : | 01-0035144 |
|---|
Links to Exploration step
Pascal:01-0035144
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>University of Bergen</s1>
<s3>NOR</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><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><inist:fA14 i1="02"><s1>INRIA Rocquencourt</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
<affiliation><inist:fA14 i1="01"><s1>University of Bergen</s1>
<s3>NOR</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">01-0035144</idno>
<date when="2000">2000</date>
<idno type="stanalyst">PASCAL 01-0035144 INIST</idno>
<idno type="RBID">Pascal:01-0035144</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000994</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>University of Bergen</s1>
<s3>NOR</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><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><inist:fA14 i1="02"><s1>INRIA Rocquencourt</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Gustedt, Jens" sort="Gustedt, Jens" uniqKey="Gustedt J" first="Jens" last="Gustedt">Jens Gustedt</name>
<affiliation><inist:fA14 i1="03"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Telle, Jan Arne" sort="Telle, Jan Arne" uniqKey="Telle J" first="Jan Arne" last="Telle">Jan Arne Telle</name>
<affiliation><inist:fA14 i1="01"><s1>University of Bergen</s1>
<s3>NOR</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2000">2000</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><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>Informatique théorique</term>
<term>Complexité algorithme</term>
<term>Algorithme parallèle</term>
<term>Connectivité graphe</term>
<term>Coloration graphe</term>
<term>Algorithme approximation</term>
</keywords><front><div type="abstract" xml:lang="en">We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most Δ<sub>G</sub>
+ 1 colors.</div><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1928</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Graph coloring on a coarse grained multiprocessor : (Extended abstract)</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Graph-theoretic concepts in computer science : Konstanz, 15-17 June 2000</s1>
</fA09><fA11 i1="01" i2="1"><s1>GEBREMEDHIN (Assefaw Hadish)</s1>
</fA11><fA11 i1="02" i2="1"><s1>LASSOUS (Isabelle Guérin)</s1>
</fA11><fA11 i1="03" i2="1"><s1>GUSTEDT (Jens)</s1>
</fA11><fA11 i1="04" i2="1"><s1>TELLE (Jan Arne)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BRANDES (Ulrik)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>WAGNER (Dorothea)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>University of Bergen</s1>
<s3>NOR</s3>
<sZ>1 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA14 i1="02"><s1>INRIA Rocquencourt</s1>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14><fA14 i1="03"><s1>LORIA & INRIA Lorraine</s1>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14><fA20><s1>184-195</s1>
</fA20><fA21><s1>2000</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-41183-6</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000092007920180</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2001 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>8 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>01-0035144</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most Δ<sub>G</sub>
+ 1 colors.</s0><fC02 i1="01" i2="X"><s0>001D02A06</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Informatique théorique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Computer theory</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Informática teórica</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Complexité algorithme</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Algorithm complexity</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Complejidad algoritmo</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Algorithme parallèle</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Parallel algorithm</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Algoritmo paralelo</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Connectivité graphe</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Graph connectivity</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Conectividad grafo</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Coloration graphe</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Graph colouring</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Coloración grafo</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Algorithme approximation</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Approximation algorithm</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>022</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>WG 2000 : international workshop on graph theoretic concepts in computer science</s1>
<s2>26</s2>
<s3>Konstanz DEU</s3>
<s4>2000-06-15</s4>
</fA30><server><NO>PASCAL 01-0035144 INIST</NO>
<ET>Graph coloring on a coarse grained multiprocessor : (Extended abstract)</ET>
<AU>GEBREMEDHIN (Assefaw Hadish); LASSOUS (Isabelle Guérin); GUSTEDT (Jens); TELLE (Jan Arne); BRANDES (Ulrik); WAGNER (Dorothea)</AU>
<AF>University of Bergen/Norvège (1 aut., 4 aut.); INRIA Rocquencourt/France (2 aut.); LORIA & INRIA Lorraine/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2000; Vol. 1928; Pp. 184-195; Bibl. 8 ref.</SO>
<LA>Anglais</LA>
<EA>We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph G with a guarantee of at most Δ<sub>G</sub>
+ 1 colors.</EA><CC>001D02A06</CC>
<FD>Informatique théorique; Complexité algorithme; Algorithme parallèle; Connectivité graphe; Coloration graphe; Algorithme approximation</FD>
<ED>Computer theory; Algorithm complexity; Parallel algorithm; Graph connectivity; Graph colouring; Approximation algorithm</ED>
<SD>Informática teórica; Complejidad algoritmo; Algoritmo paralelo; Conectividad grafo; Coloración grafo</SD>
<LO>INIST-16343.354000092007920180</LO>
<ID>01-0035144</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000994 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000994 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:01-0035144
|texte= Graph coloring on a coarse grained multiprocessor : (Extended abstract)
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
