144 search results - page 1 / 29 » Efficient Algorithms for Weighted Colorings of Series-Parall... |
ISAAC
2001
Springer
13 years 9 months ago
2001
Springer
INFORMATICASI
2006
13 years 4 months ago
2006
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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...
AAAI
2008
13 years 7 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
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...