41 search results - page 6 / 9 » Covering Graphs with Few Complete Bipartite Subgraphs |
107
click to vote
COLT
2003
Springer
15 years 6 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
140
click to vote
TKDE
2012
13 years 3 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
107
click to vote
AMAI
2005
Springer
15 years 1 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
110
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
115
click to vote
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...