4009 search results - page 318 / 802 » Clustering on Complex Graphs |
201
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
166
Voted
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
241
click to vote
Publication
Artificial neural networks, electronic circuits, and gene networks are some examples of systems that can be modeled as networks, that is, as collections of interconnected nodes. I...
184
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
162
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...