Sciweavers

3204 search results - page 236 / 641
» The Alcuin Number of a Graph
Sort
View
WEBI
2009
Springer
16 years 1 months ago
Effective Keyword Search for Software Resources Installed in Large-Scale Grid Infrastructures
—In this paper, we investigate the problem of supporting keyword-based searching for the discovery of software resources that are installed on the nodes of largescale, federated ...
George Pallis, Asterios Katsifodimos, Marios D. Di...
COCOON
2007
Springer
16 years 24 days ago
Colored Simultaneous Geometric Embeddings
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabr...
SAC
2005
ACM
16 years 5 days ago
On unit task linear-nonlinear two-cluster scheduling problem
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
Zhichun Xiao, Wing Ning Li, John Jing-Fu Jenq
ICCSA
2004
Springer
15 years 12 months ago
Searching for 2D Spatial Network Holes
Research involving different forms of networks, such as internet networks, social networks, and cellular networks, has increasingly become an important field of study. From this wo...
Femke Reitsma, Shane Engel
ISAAC
2004
Springer
115views Algorithms» more  ISAAC 2004»
15 years 12 months ago
Multicriteria Global Minimum Cuts
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
Amitai Armon, Uri Zwick