|
Volumn , Issue , 1992, Pages 71-74
|
On the complexity of distance-2 coloring
a a |
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATION ALGORITHMS;
COLORING;
GRAPHIC METHODS;
BROADCAST SCHEDULING;
GENERAL GRAPH;
MAXIMUM DEGREE;
MULTI-HOP RADIO NETWORKS;
NP COMPLETE;
PLANAR GRAPH;
UNDIRECTED GRAPH;
VERTEX DEGREE;
GRAPH THEORY;
|
EID: 85053972651
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICCI.1992.227702 Document Type: Conference Paper |
Times cited : (62)
|
References (10)
|