File:Single run of Karger’s Mincut algorithm.svg
Summary
Category:Uploaded with en.wp upload wizard#79879094000001| Description |
English: A single (successful) run of Karger’s algorithm for randomized minimum cut on on two copies of K5 and three edges. |
||
| Date |
Category:Incorrect date
|
||
| Source | Created in python using the networkx library for graph manipulation, neato for layout, and TikZ for drawing. | ||
| Author | Thore Husfeldt |
Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
 |
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. |
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
- 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.
You may select the license of your choice.