1605 search results - page 33 / 321 » On Partitional Labelings of Graphs |
KDD
2001
ACM
14 years 9 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...
DAM
2008
13 years 8 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
ICCV
2005
IEEE
14 years 10 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...