File:Matching With Flow.png

Summary


Category:Files moved from he.wikipedia to Commons requiring review#Matching%20With%20Flow.pngCategory:Files moved to Commons requiring review as of 6 January 2012#Matching%20With%20Flow.png
Description
עברית: מציאת שידוך מקסימום בגרף דו צדדי באמצעות רשת זרימה, מעשה ידי, בעזרת התוכנה Dia.
Date 9 March 2006 (original upload date)
Source Transferred from he.wikipedia to Commons.
Author Gadial at Hebrew Wikipedia

Licensing

Gadial at Hebrew Wikipedia, the copyright holder of this work, hereby publishes it under the following licenses:
GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
Category:License migration redundant#Matching%20With%20Flow.pngCategory:GFDL#Matching%20With%20Flow.png
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
Attribution:
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
Category:CC-BY-SA-3.0#Matching%20With%20Flow.png
You may select the license of your choice.
Category:Self-published work

Original upload log

The original description page was here. All following user names refer to he.wikipedia.
  • 2006-03-09 20:45 Gadial 240×164× (11074 bytes) מציאת שידוך מקסימום ב[[גרף דו צדדי]] באמצעות [[רשת זרימה]], מעשה ידי, בעזרת התוכנה Dia.
  • 2006-03-09 20:38 Gadial 442×302× (18478 bytes) מציאת שידוך מקסימום ב[[גרף דו צדדי]] באמצעות [[רשת זרימה]], מעשה ידי, בעזרת התוכנה Dia.
Category:Graph algorithms
Category:CC-BY-SA-3.0 Category:Files moved from he.wikipedia to Commons requiring review Category:Files moved to Commons requiring review as of 6 January 2012 Category:GFDL Category:Graph algorithms Category:License migration redundant Category:Self-published work