5473 search results - page 151 / 1095 » On the graph isomorphism problem |
223
click to vote
EDBT
2012
ACM
13 years 9 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
232
click to vote
TKDE
2012
13 years 9 months ago
2012
—As the exponential explosion of various contents generated on the Web, Recommendation techniques have become increasingly indispensable. Innumerable different kinds of recommend...
219
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
172
click to vote
COMBINATORICA
2008
15 years 7 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
203
click to vote
KDD
2001
ACM
16 years 7 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...