Similarity |
Page |
Snapshot |
| 55 |
This description immediately leads to an inefficient algorithm for the generation of single link classes
... |
| 54 |
the hierarchy one can identify a set of classes,and as one moves up the hierarchy the classes at the lower levels are nested in the classes at the higher levels
...It is now a simple matter to define single link in terms of these graphs;at any level a single link cluster is precisely the set of vertices of a connected component of the graph at that level
...corresponding clusters at those levels
... |
| 64 |
38
...39
...40
...41
...42
...43
...44
...45
...46
...47
...48
...49
...50
...51
...52
...53
...54
...55
...56
...57
...58
... |