File:Join-tree-clustering-1.svg

Original file (SVG file, nominally 171 × 261 pixels, file size: 4 KB)

Summary

Description Join-tree clustering, first image: a binary problem represented by a graph that is not chordal: the cycle x3x4x5x6 has length 4 but has no chords. In Image:Join-tree-clustering-2.svg, the graph will be made chordal.
Date 18 February 2006 (original upload date)
Source No machine-readable source provided. Own work assumed (based on copyright claims).
Author No machine-readable author provided. Tizio assumed (based on copyright claims).

Licensing

Public ___domain I, the copyright holder of this work, release this work into the public ___domain. This applies worldwide.
In some countries this may not be legally possible; if so:
I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

18 February 2006

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current13:17, 18 February 2006Thumbnail for version as of 13:17, 18 February 2006171 × 261 (4 KB)TizioJoin-tree clustering, first image: a binary problem represented by a graph that is not chordal: the cycle x3x4x5x6 has lenght 4 but has no chords. In Image:Join-tree-clustering-2.svg, the graph will be made chordal. [[Category:Constraint satisfaction

The following page uses this file: