2314 search results - page 98 / 463 » Minimal Partitions of a Graph |
121
Voted
DM
2006
15 years 3 months ago
2006
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
124
click to vote
MIS
1999
Springer
15 years 7 months ago
1999
Springer
Recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request yet achieve considerable client stream sharing (i.e.,...
111
Voted
UAI
2004
15 years 5 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
130
click to vote
DAC
1994
ACM
15 years 7 months ago
1994
ACM
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
129
Voted
FQAS
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...