961 search results - page 69 / 193 » Significance-Driven Graph Clustering |
117
Voted
ISI
2007
Springer
15 years 10 months ago
2007
Springer
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
136
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
113
Voted
APPML
2002
15 years 4 months ago
2002
A method for structural clustering is proposed involving data on subset-to-entity linkages that can be calculated with structural data such as graphs or sequences or images. The m...
159
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
132
Voted
INFOVIS
2000
IEEE
15 years 8 months ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...