4009 search results - page 196 / 802 » Clustering on Complex Graphs |
146
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
The growth of the web has directly influenced the increase in the availability of relational data. One of the key problems in mining such data is computing the similarity between o...
110
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
142
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
172
Voted
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of d...
143
click to vote
WICON
2008
15 years 5 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...