2314 search results - page 185 / 463 » Minimal Partitions of a Graph |
227
Voted
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of producing a global ranking of items given pairwise ranking information, when the items to be ranked arrive in an online fashion. We study both the maximizat...
152
click to vote
ISBI
2007
IEEE
15 years 10 months ago
2007
IEEE
3D cell culture assays have emerged as the basis of an improved model system for evaluating therapeutic agents, molecular probes, and exogenous stimuli. However, there is a gap in...
147
click to vote
DM
2006
15 years 4 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
124
click to vote
DAM
2000
15 years 3 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
114
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...