41 search results - page 7 / 9 » Covering Graphs with Few Complete Bipartite Subgraphs |
WWW
2001
ACM
14 years 8 months ago
2001
ACM
This paper proposes a method for finding related Web pages based on connectivity information of hyperlinks. As claimed by Kumar, a complete bipartite graph of Web pages can be reg...
CVPR
2003
IEEE
14 years 27 days ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
COMBINATORICA
2010
13 years 5 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...