提示
李国君
-
68浏览
-
0点赞
-
0收藏
-
0分享
-
85下载
-
0评论
-
引用
期刊论文
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms 47(2003)1-13，-0001，（）：
A tree of rings is an undirected graph obtained from a tree by replacing each node of the tree with a cycle (called tree-node-cycle) and then contracting the edges of the tree so that two cycles corresponding to the two end-nodes of any edge have precisely one node in common and no three tree-node-cycles share a same node. (A more general definition may allow them to share the same node.) Given a set of paths on a tree of rings, the path coloring problem is to color these paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors. In
【免责声明】以下全部内容由[李国君]上传于[2009年03月06日 13时27分52秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
