1941 search results - page 107 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
CCR
2004
14 years 9 months ago
2004
This paper emphasizes the need for methodological frameworks for analysis and design of large scale networks which are independent of specific design innovations and their advocac...
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...
PODC
2011
ACM
14 years 24 days ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Software development is rarely an individual effort and generally involves teams of developers collaborating to generate good reliable code. Among the software code there exist te...
ISAAC
2003
Springer
15 years 3 months ago
2003
Springer
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...