ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Max-Coloring Paths: Tight Bounds and Extensions

Kavitha, Telikepalli and Mestre, Julian (2009) Max-Coloring Paths: Tight Bounds and Extensions. In: 20th International Symposium on Algorithms and Computations (ISAAC 2009), DEC 16-18, 2009, Honolulu, pp. 87-96.

Full text not available from this repository. (Request a copy)
Official URL: http://www.springerlink.com/content/a741149k4q824h...


The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Depositing User: Id for Latest eprints
Date Deposited: 23 Aug 2010 10:03
Last Modified: 26 Oct 2018 14:44
URI: http://eprints.iisc.ac.in/id/eprint/31341

Actions (login required)

View Item View Item