Sciweavers

39 search results - page 1 / 8
» Edge Coloring and Decompositions of Weighted Graphs
Sort
View
ESA
2008
Springer
142views Algorithms» more  ESA 2008»
13 years 5 months ago
Edge Coloring and Decompositions of Weighted Graphs
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
Uriel Feige, Mohit Singh
WG
2004
Springer
13 years 9 months ago
Coloring a Graph Using Split Decomposition
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
Michaël Rao
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
13 years 3 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas
COMGEO
2004
ACM
13 years 3 months ago
The weighted farthest color Voronoi diagram on trees and graphs
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera ...
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
13 years 9 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...