4009 search results - page 138 / 802 » Clustering on Complex Graphs |
149
click to vote
TCS
2010
15 years 2 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
113
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
117
click to vote
CLUSTER
2004
IEEE
15 years 7 months ago
2004
IEEE
We describe the use of component architecture in an area to which this approach has not been classically applied, the area of cluster system software. By "cluster system soft...
180
click to vote
RECOMB
2010
Springer
15 years 2 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
131
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...