File:Maximum bipartite matching to max flow.svg

From Vigyanwiki

Original file(SVG file, nominally 815 × 390 pixels, file size: 11 KB)

This file is from Wikimedia Commons and may be used by other projects. The description on its file description page there is shown below.

Summary

Description
English: Transformation of Maximum Cardinality Bipartite Matching into Maximum Flow Problem
Date 09/07/2009
Source Self-created using Dia.
Author Chin Ho Lee

Licensing

Public domain This work has been released into the public domain by its author, Tcshasaposse at English Wikipedia. This applies worldwide.
In some countries this may not be legally possible; if so:
Tcshasaposse grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.

Original upload log

Transferred from en.wikipedia to Commons by Milicevic01 using CommonsHelper.

The original description page was here. All following user names refer to en.wikipedia.
  • 2009-07-10 03:19 Tcshasaposse 815×390× (11076 bytes)
  • 2009-07-10 03:01 Tcshasaposse 815×390× (11028 bytes)
  • 2009-07-09 09:08 Tcshasaposse 200×393× (7188 bytes)
  • 2009-07-09 08:59 Tcshasaposse 226×393× (7316 bytes) {{Information |Description = Transformation of Maximum Cardinality Bipartite Matching into Maximum Flow Problem |Source = Self-created using Graphviz. |Date = 09/07/2009 |Author = Chin Ho Lee |other_versions = }}

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

File history

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

Date/TimeThumbnailDimensionsUserComment
current21:42, 1 June 2013Thumbnail for version as of 21:42, 1 June 2013815 × 390 (11 KB)wikimediacommons>OgreBot(BOT): Reverting to most recent version before archival

Metadata