376 search results - page 54 / 76 » Completely connected clustered graphs |
141
Voted
WWW
2010
ACM
15 years 10 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
133
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
149
Voted
SEKE
2001
Springer
15 years 8 months ago
2001
Springer
Source code analysis and inspection does not provide enough information to describe the structure of an objectoriented program completely because there are components and relation...
127
Voted
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
125
click to vote
MODELS
2009
Springer
15 years 10 months ago
2009
Springer
Recently, a generic approach for syntax-based user assistance in diagram editors has been proposed that requires the syntax of the visual language to be defined by a graph grammar...