Sciweavers

2137 search results - page 142 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
TEI
2009
ACM
103views Hardware» more  TEI 2009»
15 years 5 months ago
A tangible construction kit for exploring graph theory
Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on ...
Eric Schweikardt, Nwanua Elumeze, Michael Eisenber...
PAMI
2006
128views more  PAMI 2006»
14 years 10 months ago
On Weighting Clustering
Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance po...
Richard Nock, Frank Nielsen
GD
1998
Springer
15 years 2 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
103
Voted
SOCIALCOM
2010
14 years 8 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
Harish Sethu, Alexander Yates
127
Voted
ENDM
2000
121views more  ENDM 2000»
14 years 10 months ago
Finding the chromatic number by means of critical graphs
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
Francine Herrmann, Alain Hertz