Edge-coloring of a bipartite graph 1.0

Version: 1.0




Link Broken:Report It!

Package:Without source


More info Download


Konig's theorem tells us that every bipartite graph with maximum vertex-degree d can be edge-colored with just d colors. This script allows you to verify this theorem.

Language: Python


Bipartite - Bipartite Graph - Coloring - Edge - Edge Coloring - Graph Tool

User Reviews:

Write Review *
Your name *
Email *
(Your comments will be reviewed by our staff before they are posted)
Rate this product *
Captcha Image
Enter code from image *



Drawing inheritance diagrams with "Dot" 1.0

Dot is a very nice graph description language developed at MIT.

By: code.activestate.com Homepage


Dijkstra's algorithm for shortest paths 1.0

This script finds the shortest paths from the start vertex to all vertices nearer than or equal to the end.

By: code.activestate.com Homepage


Jason's Check It 1.0

Jason's Check It is a Unix compatible script that is written in PERL (CGI) and by an unknown script writer. This script is very easy to install and...

By: RF Homepage


Graph Script 1.1

This script allows you to create a directed Graph container that can be useful for the collections module.

By: code.activestate.com Homepage


Finding Eulerian path in undirected graph 1.0

This script takes as input a graph and outputs Eulerian path (if such exists).

By: code.activestate.com Homepage


RDF Graph Browser 1.0

A java-swing application that provides a tree-view of a jena rdf-graph.

By: Rdfgraphbrowser Homepage


skeleton based shapematching &retrieval 1.0

This methods encodes the three dimensional objects in the form of skeletal graph and uses graph matching techniques to match the skeletons and...

By: Skeletonbasedsh Homepage


Bron-Kerbosch Maximal Independent Set Algorithm 1.0

Maximal independent sets come in handy for certain applications.

By: mathworks.com Homepage


User Quota Graph 1.0.1

User Quota Graph is a graph maker programme that allows all your input datas, interprets and gives output as a graphical chart or text edit. The...

By: Andrew Collington Homepage


JSearchDemo 1.0

Algorithms like depth-first, breadth-first, greedy search, hill climbing, A*, IDA, beam search, uniform cost or EE uniform cost can be previewed...

By: el-tramo.be Homepage