File:Csp-dual-graph-1.svg
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
![File:Csp-dual-graph-1.svg](https://upload.wikimedia.org/wikipedia/commons/thumb/f/fd/Csp-dual-graph-1.svg/288px-Csp-dual-graph-1.svg.png?20060215165536)
Size of this PNG preview of this SVG file: 288 × 126 pixels. Other resolutions: 320 × 140 pixels | 640 × 280 pixels | 1,024 × 448 pixels | 1,280 × 560 pixels | 2,560 × 1,120 pixels.
Original file (SVG file, nominally 288 × 126 pixels, file size: 6 KB)
File information
Structured data
Captions
Captions
Add a one-line explanation of what this file represents
Summary
[edit]DescriptionCsp-dual-graph-1.svg | Given the constraints and their variables, one can build the dual graph: a node for each constraint, an edge for each pair of constraints sharing at least one variable. This edge is labeled by the common variable to indicate that the dual problem has a constraint that enforces equality of these variables. |
Date | 15 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
[edit]Public domainPublic domainfalsefalse |
![]() |
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. |
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 16:55, 15 February 2006 | ![]() | 288 × 126 (6 KB) | Tizio (talk | contribs) | Wrong image |
16:52, 15 February 2006 | ![]() | 360 × 261 (12 KB) | Tizio (talk | contribs) | White background | |
16:39, 15 February 2006 | ![]() | 279 × 117 (6 KB) | Tizio (talk | contribs) | Given the constraints and their variables, one can build the dual graph: a node for each constraint, an edge for each pair of constraints sharing at least one variable. This edge is labeled by the common variable to indicate that the dual problem has a co |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on en.wikipedia.org