EFFICIENT PARALLEL AND SEQUENTIAL ALGORITHMS FOR 4-COLORING PERFECT PLANAR GRAPHS

被引:0
作者
XIN, H
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:545 / 559
页数:15
相关论文
共 25 条
[1]  
Berge C., 1973, GRAPHS HYPERGRAPHS
[2]  
BONDY JA, 1980, GRAPH THEORY APPLICA
[3]   COLORING PLANAR GRAPHS IN PARALLEL [J].
BOYAR, JF ;
KARLOFF, HJ .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1987, 8 (04) :470-479
[4]   A LINEAR 5-COLORING ALGORITHM OF PLANAR GRAPHS [J].
CHIBA, N ;
NISHIZEKI, T ;
SAITO, N .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1981, 2 (04) :317-327
[5]   ARBORICITY AND SUBGRAPH LISTING ALGORITHMS [J].
CHIBA, N ;
NISHIZEKI, T .
SIAM JOURNAL ON COMPUTING, 1985, 14 (01) :210-223
[6]  
Cole R., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P511, DOI 10.1109/SFCS.1986.41
[7]   ON LINEAR-TIME ALGORITHMS FOR 5-COLORING PLANAR GRAPHS [J].
FREDERICKSON, GN .
INFORMATION PROCESSING LETTERS, 1984, 19 (05) :219-224
[8]  
GOLDBERG AV, 1987, 19TH P ANN ACM S THE, P315
[9]  
Golumbic M. C., 1980, ALGORITHMIC GRAPH TH
[10]  
HAGERUP T, 1987, 14TH P ICALP, P304