Documents Clustering Chapter 7

Example of the “too simple tree growing” algorithm Graph with 2n+2 nodes; tree growing: |CDS|=n+2; Minimum |CDS|=4 tree growing: start … Minimum CDS u u u v v v Ad…

Documents Clustering Chapter 7

Example of the “too simple tree growing” algorithm Graph with 2n+2 nodes; tree growing: |CDS|=n+2; Minimum |CDS|=4 tree growing: start … Minimum CDS u u u v v v Ad…

Documents Clustering Chapter 8

Example of the “too simple tree growing” algorithm Graph with 2n+2 nodes; tree growing: |CDS|=n+2; Minimum |CDS|=4 tree growing: starting … Minimum CDS u u u v v v…