66 search results - page 10 / 14 » Balanced coloring of bipartite graphs |
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
JUCS
2002
13 years 7 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
SIAMDM
2010
13 years 2 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
ICCCN
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobile sensors can move to event l...