301 search results - page 45 / 61 » On Finding Dense Subgraphs |
227
click to vote
ACID
2006
15 years 5 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
139
click to vote
COLOGNETWENTE
2009
15 years 5 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
158
click to vote
COLOGNETWENTE
2010
15 years 1 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...
130
click to vote
JMLR
2010
14 years 11 months ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
173
click to vote
JMLR
2010
14 years 11 months ago
2010
We introduce a simple order-based greedy heuristic for learning discriminative structure within generative Bayesian network classifiers. We propose two methods for establishing an...