A self-stabilizing ( Δ + 4 )-edge-coloring algorithm for planar graphs in anonymous uniform systems

This paper proposes a self-stabilizing edge-coloring algorithm using ( Δ + 4 ) colors for distributed systems of a planar graph topology, where Δ ⩾ 5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O ( n 2 ) moves under the cen...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 101; no. 4; pp. 168 - 173
Main Authors Tzeng, Chi-Hung, Jiang, Jehn-Ruey, Huang, Shing-Tsaan
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 28.02.2007
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Distributed systems
Edge coloring
Exact sciences and technology
Graph theory
Graphs
Mathematics
Planar graphs
Sciences and techniques of general use
Self-stabilization
Studies
Theoretical computing
Topology
Self-stabilization
Distributed systems
Edge coloring
Planar graphs
Computer theory
Planar graph
Distributed system
Topology
Graph degree
Graph colouring
Time complexity
Algorithm analysis
Graph algorithm
Online AccessGet full text
ISSN0020-0190
1872-6119
DOI10.1016/j.ipl.2006.09.004

Cover

Abstract This paper proposes a self-stabilizing edge-coloring algorithm using ( Δ + 4 ) colors for distributed systems of a planar graph topology, where Δ ⩾ 5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O ( n 2 ) moves under the central daemon model.
AbstractList This paper proposes a self-stabilizing edge-coloring algorithm using ( Δ + 4 ) colors for distributed systems of a planar graph topology, where Δ ⩾ 5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O ( n 2 ) moves under the central daemon model.
This paper proposes a self-stabilizing edge-coloring algorithm using (...+4) colors for distributed systems of a planar graph topology, where ...5 is the maximum degree of the graph. The algorithm can be applied to anonymous uniform systems and its time complexity is O(n...) moves under the central daemon model. (ProQuest Information and Learning: ... denotes formulae/symbols omitted.)
Author Tzeng, Chi-Hung
Huang, Shing-Tsaan
Jiang, Jehn-Ruey
Author_xml – sequence: 1
  givenname: Chi-Hung
  surname: Tzeng
  fullname: Tzeng, Chi-Hung
  organization: Department of Computer Science, National Tsing-Hua University, Taiwan, ROC
– sequence: 2
  givenname: Jehn-Ruey
  surname: Jiang
  fullname: Jiang, Jehn-Ruey
  email: jrjiang@csie.ncu.edu.tw
  organization: Department of Computer Science and Information Engineering, National Central University, Taiwan, ROC
– sequence: 3
  givenname: Shing-Tsaan
  surname: Huang
  fullname: Huang, Shing-Tsaan
  organization: Department of Computer Science and Information Engineering, National Central University, Taiwan, ROC
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=18411523$$DView record in Pascal Francis
BookMark eNp9kN1qHCEYQKUk0E3aB-idFAotZaafOj9Kr0LoHwRyk16L4-jGxdGpuoHtc_S5-kxx2UChF7lS8Jzvk3OBzkIMBqE3BFoCZPi0a93qWwowtCBagO4F2hA-0mYgRJyhDQCFBoiAl-gi5x1UsGPjBs1XOBtvm1zU5Lz77cIWv8d__-CPuMMfGjNvTaOjj-n4oPy2Xsr9gm1MePUqqIS3Sa33GbuAVf3TYYn7jPfBVWLB-ZCLWfIrdG6Vz-b103mJfn79cnf9vbm5_fbj-uqm0azvSjN0QjDKuoGauR-5taznVnEilCD9bCc62W4QA0xmngwQK0bLNJkGzY0FAsAu0dvT3DXFX3uTi9zFfQp1paRspJxzSiv07glSWStvkwraZbkmt6h0kIR3hPSUVY6cOJ1izsnYfwjIY3O5k7W5PDaXIGRtXp3xP0e7ooqLoSTl_LPm55Npap8HZ5LM2pmgzeyS0UXO0T1jPwIiip2G
CODEN IFPLAT
CitedBy_id crossref_primary_10_1007_s00446_009_0082_8
crossref_primary_10_1016_j_jpdc_2009_11_006
crossref_primary_10_1016_j_tcs_2010_11_010
crossref_primary_10_1016_j_tcs_2012_01_034
crossref_primary_10_4018_ijalr_2012100102
crossref_primary_10_1016_j_ipl_2009_01_013
Cites_doi 10.1016/0196-6774(87)90046-0
10.1145/361179.361202
10.1016/0196-6774(90)90032-A
10.1007/s004930170002
10.1137/0211009
10.1007/s003730070009
10.1006/jctb.2001.2047
10.1016/0196-6774(87)90026-5
10.1016/j.ipl.2005.03.005
10.1137/S0097539798427156
10.1007/BF02278856
10.1137/0210055
ContentType Journal Article
Copyright 2006 Elsevier B.V.
2007 INIST-CNRS
Copyright Elsevier Sequoia S.A. Feb 28, 2007
Copyright_xml – notice: 2006 Elsevier B.V.
– notice: 2007 INIST-CNRS
– notice: Copyright Elsevier Sequoia S.A. Feb 28, 2007
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ipl.2006.09.004
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
Mathematics
EISSN 1872-6119
EndPage 173
ExternalDocumentID 1182912211
18411523
10_1016_j_ipl_2006_09_004
S0020019006002766
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c354t-6499323462ed578ff358fa819a915dfb2bf46960bedbe01f97f3c1b6c8ef01003
IEDL.DBID AIKHN
ISSN 0020-0190
IngestDate Sun Sep 07 03:48:56 EDT 2025
Mon Jul 21 09:15:38 EDT 2025
Wed Oct 01 03:08:53 EDT 2025
Thu Apr 24 23:12:51 EDT 2025
Fri Feb 23 02:30:03 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Self-stabilization
Distributed systems
Edge coloring
Planar graphs
Computer theory
Planar graph
Distributed system
Topology
Graph degree
Graph colouring
Time complexity
Algorithm analysis
Graph algorithm
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c354t-6499323462ed578ff358fa819a915dfb2bf46960bedbe01f97f3c1b6c8ef01003
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 237288822
PQPubID 45522
PageCount 6
ParticipantIDs proquest_journals_237288822
pascalfrancis_primary_18411523
crossref_primary_10_1016_j_ipl_2006_09_004
crossref_citationtrail_10_1016_j_ipl_2006_09_004
elsevier_sciencedirect_doi_10_1016_j_ipl_2006_09_004
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2007-02-28
PublicationDateYYYYMMDD 2007-02-28
PublicationDate_xml – month: 02
  year: 2007
  text: 2007-02-28
  day: 28
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 2007
Publisher Elsevier B.V
Elsevier Science
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science
– name: Elsevier Sequoia S.A
References Marathe, Panconesi, Risinger (bib012) 2004; 9
Gabow, Kariv (bib006) 1982; 11
Ghosh, Karaata (bib007) 1993; 7
Vizing (bib014) 1964; 3
Boyar, Karloff (bib002) 1987; 8
Zhang (bib016) 2000; 16
Cole, Ost, Schirra (bib004) 2001; 21
Grable, Panconesi (bib008) 1997; 10
Vizing (bib015) 1965; 5
Dijkstra (bib005) 1974; 17
Karloff, Shmoys (bib011) 1987; 8
Bruell, Ghosh, Karaata, Pemmaraju (bib001) 1999; 29
Sanders, Zhao (bib013) 2001; 8
Huang, Hung, Tzeng (bib010) 2005; 95
Chrobak, Nishizeki (bib003) 1990; 11
Holyer (bib009) 1981; 10
Chrobak (10.1016/j.ipl.2006.09.004_bib003) 1990; 11
Marathe (10.1016/j.ipl.2006.09.004_bib012) 2004; 9
Vizing (10.1016/j.ipl.2006.09.004_bib015) 1965; 5
Grable (10.1016/j.ipl.2006.09.004_bib008) 1997; 10
Huang (10.1016/j.ipl.2006.09.004_bib010) 2005; 95
Karloff (10.1016/j.ipl.2006.09.004_bib011) 1987; 8
Zhang (10.1016/j.ipl.2006.09.004_bib016) 2000; 16
Boyar (10.1016/j.ipl.2006.09.004_bib002) 1987; 8
Vizing (10.1016/j.ipl.2006.09.004_bib014) 1964; 3
Cole (10.1016/j.ipl.2006.09.004_bib004) 2001; 21
Sanders (10.1016/j.ipl.2006.09.004_bib013) 2001; 8
Gabow (10.1016/j.ipl.2006.09.004_bib006) 1982; 11
Ghosh (10.1016/j.ipl.2006.09.004_bib007) 1993; 7
Dijkstra (10.1016/j.ipl.2006.09.004_bib005) 1974; 17
Bruell (10.1016/j.ipl.2006.09.004_bib001) 1999; 29
Holyer (10.1016/j.ipl.2006.09.004_bib009) 1981; 10
References_xml – volume: 11
  start-page: 102
  year: 1990
  end-page: 116
  ident: bib003
  article-title: Improved edge-coloring algorithms for planar graphs
  publication-title: Journal of Algorithms
– volume: 11
  start-page: 117
  year: 1982
  end-page: 129
  ident: bib006
  article-title: Algorithms for edge coloring bipartite graphs and multigraphs
  publication-title: SIAM Journal on Computing
– volume: 21
  start-page: 5
  year: 2001
  end-page: 12
  ident: bib004
  article-title: Edge coloring bipartite multigraphs in
  publication-title: Combinatorica
– volume: 16
  start-page: 467
  year: 2000
  end-page: 495
  ident: bib016
  article-title: Every planar graph with maximum degree 7 is of class 1
  publication-title: Graphs and Combinatorics
– volume: 95
  start-page: 307
  year: 2005
  end-page: 312
  ident: bib010
  article-title: Self-stabilizing coloration in anonymous planar networks
  publication-title: Information Processing Letters
– volume: 8
  start-page: 470
  year: 1987
  end-page: 479
  ident: bib002
  article-title: Coloring planar graphs in parallel
  publication-title: Journal of Algorithms
– volume: 10
  start-page: 385
  year: 1997
  end-page: 405
  ident: bib008
  article-title: Nearly optimal distributed edge coloring in
  publication-title: RSA
– volume: 8
  start-page: 39
  year: 1987
  end-page: 52
  ident: bib011
  article-title: Efficient parallel algorithms for edge coloring problems
  publication-title: Journal of Algorithms
– volume: 8
  start-page: 201
  year: 2001
  end-page: 212
  ident: bib013
  article-title: Planar graphs of maximum degree seven are class I
  publication-title: Journal of Combinatorial Theory, Series B
– volume: 5
  start-page: 9
  year: 1965
  end-page: 17
  ident: bib015
  article-title: Critical graphs with given chromatic class
  publication-title: Metody Diskret. Analiz
– volume: 3
  start-page: 25
  year: 1964
  end-page: 30
  ident: bib014
  article-title: On an estimate of the chromatic class of a
  publication-title: Diskret. Analiz
– volume: 10
  start-page: 718
  year: 1981
  end-page: 720
  ident: bib009
  article-title: The NP-completeness of edge coloring
  publication-title: SIAM Journal of Computing
– volume: 29
  start-page: 600
  year: 1999
  end-page: 614
  ident: bib001
  article-title: Self-stabilizing algorithms for finding centers and medians of trees
  publication-title: SIAM Journal of Computing
– volume: 9
  start-page: 1
  year: 2004
  end-page: 22
  ident: bib012
  article-title: An experimental study of a simple, distributed edge-coloring algorithm
  publication-title: ACM Journal of Experimental Algorithms
– volume: 17
  start-page: 643
  year: 1974
  end-page: 644
  ident: bib005
  article-title: Self-stabilizing systems in spite of distributed control
  publication-title: Communications of the ACM
– volume: 7
  start-page: 55
  year: 1993
  end-page: 59
  ident: bib007
  article-title: A self-stabilizing algorithm for coloring planar graph
  publication-title: Distributed Computing
– volume: 8
  start-page: 470
  year: 1987
  ident: 10.1016/j.ipl.2006.09.004_bib002
  article-title: Coloring planar graphs in parallel
  publication-title: Journal of Algorithms
  doi: 10.1016/0196-6774(87)90046-0
– volume: 17
  start-page: 643
  year: 1974
  ident: 10.1016/j.ipl.2006.09.004_bib005
  article-title: Self-stabilizing systems in spite of distributed control
  publication-title: Communications of the ACM
  doi: 10.1145/361179.361202
– volume: 11
  start-page: 102
  year: 1990
  ident: 10.1016/j.ipl.2006.09.004_bib003
  article-title: Improved edge-coloring algorithms for planar graphs
  publication-title: Journal of Algorithms
  doi: 10.1016/0196-6774(90)90032-A
– volume: 3
  start-page: 25
  year: 1964
  ident: 10.1016/j.ipl.2006.09.004_bib014
  article-title: On an estimate of the chromatic class of a p-graph
  publication-title: Diskret. Analiz
– volume: 21
  start-page: 5
  issue: 1
  year: 2001
  ident: 10.1016/j.ipl.2006.09.004_bib004
  article-title: Edge coloring bipartite multigraphs in O(ElogD) time
  publication-title: Combinatorica
  doi: 10.1007/s004930170002
– volume: 11
  start-page: 117
  issue: 1
  year: 1982
  ident: 10.1016/j.ipl.2006.09.004_bib006
  article-title: Algorithms for edge coloring bipartite graphs and multigraphs
  publication-title: SIAM Journal on Computing
  doi: 10.1137/0211009
– volume: 9
  start-page: 1
  year: 2004
  ident: 10.1016/j.ipl.2006.09.004_bib012
  article-title: An experimental study of a simple, distributed edge-coloring algorithm
  publication-title: ACM Journal of Experimental Algorithms
– volume: 16
  start-page: 467
  issue: 4
  year: 2000
  ident: 10.1016/j.ipl.2006.09.004_bib016
  article-title: Every planar graph with maximum degree 7 is of class 1
  publication-title: Graphs and Combinatorics
  doi: 10.1007/s003730070009
– volume: 8
  start-page: 201
  issue: 2
  year: 2001
  ident: 10.1016/j.ipl.2006.09.004_bib013
  article-title: Planar graphs of maximum degree seven are class I
  publication-title: Journal of Combinatorial Theory, Series B
  doi: 10.1006/jctb.2001.2047
– volume: 10
  start-page: 385
  issue: 3
  year: 1997
  ident: 10.1016/j.ipl.2006.09.004_bib008
  article-title: Nearly optimal distributed edge coloring in O(loglogn) rounds
  publication-title: RSA
– volume: 8
  start-page: 39
  year: 1987
  ident: 10.1016/j.ipl.2006.09.004_bib011
  article-title: Efficient parallel algorithms for edge coloring problems
  publication-title: Journal of Algorithms
  doi: 10.1016/0196-6774(87)90026-5
– volume: 95
  start-page: 307
  issue: 1
  year: 2005
  ident: 10.1016/j.ipl.2006.09.004_bib010
  article-title: Self-stabilizing coloration in anonymous planar networks
  publication-title: Information Processing Letters
  doi: 10.1016/j.ipl.2005.03.005
– volume: 29
  start-page: 600
  issue: 2
  year: 1999
  ident: 10.1016/j.ipl.2006.09.004_bib001
  article-title: Self-stabilizing algorithms for finding centers and medians of trees
  publication-title: SIAM Journal of Computing
  doi: 10.1137/S0097539798427156
– volume: 7
  start-page: 55
  year: 1993
  ident: 10.1016/j.ipl.2006.09.004_bib007
  article-title: A self-stabilizing algorithm for coloring planar graph
  publication-title: Distributed Computing
  doi: 10.1007/BF02278856
– volume: 5
  start-page: 9
  year: 1965
  ident: 10.1016/j.ipl.2006.09.004_bib015
  article-title: Critical graphs with given chromatic class
  publication-title: Metody Diskret. Analiz
– volume: 10
  start-page: 718
  issue: 4
  year: 1981
  ident: 10.1016/j.ipl.2006.09.004_bib009
  article-title: The NP-completeness of edge coloring
  publication-title: SIAM Journal of Computing
  doi: 10.1137/0210055
SSID ssj0006437
Score 1.8229952
Snippet This paper proposes a self-stabilizing edge-coloring algorithm using ( Δ + 4 ) colors for distributed systems of a planar graph topology, where Δ ⩾ 5 is the...
This paper proposes a self-stabilizing edge-coloring algorithm using (...+4) colors for distributed systems of a planar graph topology, where ...5 is the...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 168
SubjectTerms Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science; control theory; systems
Distributed systems
Edge coloring
Exact sciences and technology
Graph theory
Graphs
Mathematics
Planar graphs
Sciences and techniques of general use
Self-stabilization
Studies
Theoretical computing
Topology
Title A self-stabilizing ( Δ + 4 )-edge-coloring algorithm for planar graphs in anonymous uniform systems
URI https://dx.doi.org/10.1016/j.ipl.2006.09.004
https://www.proquest.com/docview/237288822
Volume 101
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier ScienceDirect
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: ACRLP
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Journal
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIKHN
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AKRWK
  dateStart: 19930125
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB7BcqlU0dKHuoWufOihD7kktuPExxUCLVTlVCRulu3Y7VZhFZHlwqG_gt_Fb-p44yxCFRy4RVEsR573eOYbgI-hkMZkTlFuRKCCBZQ5VzKah6JwnNWsVLE5-cepnJ2Jk_PifAMOhl6YWFaZdH-v01faOr3ZT6e5387nscc31gOpiCiCsZWUm7CF9qeqRrA1Pf4-O10r5Hg31Vd6xBostb7cXJV5zdsmXUlE4ErxkHl63poODy300y7-U9wra3T0EraTG0mm_Z_uwIZfvIIXw4gGkiT2NdRT0vkmUPQBYxXsNRoq8onc3pCvRJDPNCbTaMStjtk9Yppf-LD8fUHQkyVtYxbmkqwQrTsyXxAzZArI1SL2c12QHga6ewNnR4c_D2Y0DVagjhdiSSWGOZxxIZmvUWJD4EUVDPoGRuVFHSyzAaNmmVlfW5_lQZWBu9xKV_mA8VvG38IIt_TvgAgbmGVKKGu94E6aXBhbGokMap1Q2Riy4Ty1S6jjcfhFo4fysj8aSRCnYUqdKY0kGMOX9ZK2h9x47GMxEEnf4xuNJuGxZZN7BL3bqBLoIzM-ht2BwjpJdacZLxkyGGPvn7brLjzrU8OxI34PRsvLK_8BfZqlncDmt7_5JHHuP04J9gY
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwELYoHFoJFfoSWwrMoYc-ZEhsx1kfEQItLXACiZtlOzZsFVYRWS499Ff0d_U3dZw4IITgwC2KYjnyeN7fzBDyORTSmMwpyo0IVLCAPOdKRvNQFI6zipUqFicfn8jJmfhxXpwvkL2hFibCKpPs72V6J63Tm510mjvNdBprfCMeSMWOIuhbSfmCLImCldED2_5zh_OImake5xERWOo2tdmBvKZNnRISsW2leEw5LTemxSML_ayLB2K700UHq-R1MiJht__PN2TBz96SlWFAAyR-fUeqXWh9HShagBED-xvVFHyBf3_hOwj4SmMojcau1TG2B6a-wIf55RWgHQtNbWbmGrp-1i1MZ2CGOAHczGI11xX0TaDb9-TsYP90b0LTWAXqeCHmVKKTwxkXkvkK-TUEXoyDQcvAqLyogmU2oM8sM-sr67M8qDJwl1vpxj6g95bxD2QRt_RrBIQNzDIllLVecCdNLowtjcTraZ1Q2Yhkw3lql3qOx9EXtR7AZb80kiDOwpQ6UxpJMCLfbpc0fcONpz4WA5H0vVujUSE8tWzzHkHvNhoLtJAZH5H1gcI68XSrGS_ZGB0S9vF5u26Rl5PT4yN9dHjyc5286oPEsTb-E1mcX9_4DbRu5nazu73_AVqR9s4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+self-stabilizing+%28+%CE%94+%2B+4+%29-edge-coloring+algorithm+for+planar+graphs+in+anonymous+uniform+systems&rft.jtitle=Information+processing+letters&rft.au=Tzeng%2C+Chi-Hung&rft.au=Jiang%2C+Jehn-Ruey&rft.au=Huang%2C+Shing-Tsaan&rft.date=2007-02-28&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=101&rft.issue=4&rft.spage=168&rft.epage=173&rft_id=info:doi/10.1016%2Fj.ipl.2006.09.004&rft.externalDocID=S0020019006002766
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon