Keyword : edge-coloring


The Complexity of (List) Edge-Coloring Reconfiguration Problem
Hiroki OSAWA Akira SUZUKI Takehiro ITO Xiao ZHOU 
Publication:   
Publication Date: 2018/01/01
Vol. E101-A  No. 1 ; pp. 232-238
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
combinatorial reconfigurationedge-coloringplanar graphPSPACE-complete
 Summary | Full Text:PDF(1.2MB)

CP-TDMA: Coloring- and Probability-Based TDMA Scheduling for Wireless Ad Hoc Networks
Xuedan ZHANG Jun HONG Lin ZHANG Xiuming SHAN Victor O. K. LI 
Publication:   IEICE TRANSACTIONS on Communications
Publication Date: 2008/01/01
Vol. E91-B  No. 1 ; pp. 322-326
Type of Manuscript:  LETTER
Category: Network
Keyword: 
wireless ad hoc networksTDMA schedulingexplicit conflictimplicit conflictedge-coloringprobability theory
 Summary | Full Text:PDF(274.8KB)

Another Simple Algorithm for Edge-Coloring Bipartite Graphs
Takashi TAKABATAKE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/05/01
Vol. E88-A  No. 5 ; pp. 1303-1304
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
bipartite matchingedge-coloringgraph algorithmscombinatorial optimization
 Summary | Full Text:PDF(57.5KB)

On-Line Edge-Coloring Algorithms for Degree-Bounded Bipartite Graphs
Masakuni TAKI Mikihito SUGIURA Toshinobu KASHIWABARA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/05/01
Vol. E85-A  No. 5 ; pp. 1062-1065
Type of Manuscript:  Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
on-line algorithmrandomizationedge-coloring
 Summary | Full Text:PDF(133.6KB)

Graph Coloring Algorithms
Xiao ZHOU Takao NISHIZEKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2000/03/25
Vol. E83-D  No. 3 ; pp. 407-417
Type of Manuscript:  INVITED SURVEY PAPER
Category: Graph Algorithms
Keyword: 
algorithmedge-coloringf-coloring[g,f]-coloringtotal coloring
 Summary | Full Text:PDF(503.8KB)

Optimal Parallel Algorithms for Edge-Coloring Partial k-Trees with Bounded Degrees
Xiao ZHOU Takao NISHIZEKI 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1995/04/25
Vol. E78-A  No. 4 ; pp. 463-469
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
edge-coloringparallel algorithmDP algorithm
 Summary | Full Text:PDF(605KB)