1101 search results - page 159 / 221 » An Algorithm for the Graph Crossing Number Problem |
122
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
125
Voted
CIAC
2006
Springer
15 years 6 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
114
click to vote
PDPTA
2003
15 years 3 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
118
click to vote
WEBI
2009
Springer
15 years 9 months ago
2009
Springer
—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 ...
130
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...