Edge-coloring of a bipartite graph Icon

Edge-coloring of a bipartite graph

Edge-coloring of a bipartite graph script allows you to verify Konig's theorem.

Edge-coloring of a bipartite graphOverview

Konig's theorem tells us that every bipartite graph with maximum vertex-degree d can be edge-colored with just d colors. This recipe relies on a previous recipe by D.Eppstein (123641) : "Hopcroft-Karp bipartite matching".

NEW

Fixed some bugs.

Edge-coloring of a bipartite graphInformation

Version
1.0
Date
04.22.10
License
Language
English
File Size
N/A
Category
SubCategory
Operating Systems
Windows ,Linux,Mac OS,BSD,Solaris
System Requirements
No additional system requirements.
Principal Component Analysis (PCA) Icon
A class that carries out Principal Component Analysis (PCA).
Free
Deal Or No Deal Game Icon
A game based on the tv game show, Deal Or No Deal.
Free
Disk Dumper Icon
This recipe will display a hex dump of the disk specified on the command line.
Complex Boolean Regular Expression Class Icon
Need to look for the occurence of words in a string or group of words
Free
Display an Image from a specified file Icon
Reads an image file from the filename specified as the 1st parameter
Free
Quickslice decorator Icon
Quickslice decorator script defines a decorator that allows for an abbreviated
Free
mx.ODBC example Icon
mx.ODBC example script shows you how to get the columns of a table and get data.
Free
Python replacement for java.util.Properties Icon
Quick and easy way to process Java properties files using pure Python
Free
More