762 search results - page 18 / 153 » Strategic Coloring of a Graph |
ESA
2008
Springer
14 years 11 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...
ERSA
2010
14 years 7 months ago
2010
Abstract--Modeling environments and performance prediction boost application productivity, but often lack integration into an efficient and comprehensive approach to strategic desi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
: Network intrusion detection systems are themselves becoming targets of attackers. Alert flood attacks may be used to conceal malicious activity by hiding it among a deluge of fa...
107
click to vote
PARA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
COMBINATORICS
2002
14 years 9 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...