3268 search results - page 593 / 654 » The hub number of a graph |
116
click to vote
IEEESCC
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
AISS
2010
14 years 9 months ago
2010
In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the infor...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
139
click to vote
ECEASST
2010
14 years 9 months ago
2010
Abstract: Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. Th...
113
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...