239 search results - page 2 / 48 » The path partition problem and related problems in bipartite... |
CORR
1999
Springer
13 years 5 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
KDD
2001
ACM
14 years 5 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...
IPMU
2010
Springer
13 years 7 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
ESA
2004
Springer
13 years 11 months ago
2004
Springer
JMMA
2010
13 years 7 days ago
2010
This paper follows a word-document co-clustering model independently introduced in 2001 by several authors such as I.S. Dhillon, H. Zha and C. Ding. This model consists in creatin...