153 search results - page 2 / 31 » Minimum cost subpartitions in graphs |
JCO
2010
14 years 8 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
SIAMDM
2010
14 years 7 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
GC
2010
Springer
14 years 8 months ago
2010
Springer
A star-factor of a graph is a spanning subgraph each of whose components is a star. A graph
ACSAC
2003
IEEE
15 years 2 months ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
AAIM
2005
Springer
15 years 3 months ago
2005
Springer