Affiliation of Author(s):山东大学数学学院

Journal:ACM Transactions on Algorithms (Journal of Algorithms）

Key Words:Path coloring, Trees of rings, Approximation algorithms

Abstract: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 this ...

All the Authors:Li, G.,Zang, W.

First Author:Deng, X.

Indexed by:Journal paper

Discipline:Natural Science

First-Level Discipline:Mathematics

Document Type:J

Volume:47

Issue:1

Page Number:1-13

Translation or Not:no

Date of Publication:2003-04-01

Included Journals:SCI