19 search results - page 4 / 4 » Approximating Maximum Edge 2-Coloring in Simple Graphs Via L... |
WINE
2005
Springer
14 years 10 days ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
FOCS
1995
IEEE
13 years 10 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...