782 search results - page 16 / 157 » Graph Clustering for Keyword Search |
IAT
2006
IEEE
14 years 1 months ago
2006
IEEE
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
WSC
2004
13 years 9 months ago
2004
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
COR
2010
13 years 8 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
We present a strategy for analyzing large, social small-world graphs, such as those formed by human networks. Our approach brings together ideas from a number of different resear...