27 search results - page 1 / 6 » On Contracting Graphs to Fixed Pattern Graphs |
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
JGT
2010
13 years 3 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
TVCG
2008
13 years 4 months ago
2008
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
GBRPR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Image segmentation has long been an important problem in the computer vision community. In our recent work we have addressed the problem of texture segmentation, where we...
SAC
2008
ACM
13 years 4 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...