3268 search results - page 236 / 654 » The hub number of a graph |
161
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...
176
click to vote
JCO
2011
15 years 1 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
194
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
181
click to vote
GECCO
2004
Springer
16 years 9 hour ago
2004
Springer
A new graph-based evolutionary algorithm named “Genetic Network Programming, GNP” has been proposed. GNP represents its solutions as directed graph structures, which can improv...
172
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...