course homepage



Bipartite Edge Colouring in O(m) time


View my slides for my class presentation (December 8th)

View my slides for my cgl presentation (November 23rd)

View my project report (December 16th)

View the Read me

View the directory containing my data files. The output consists of:

   max-degree  number-of-edges  time-in-seconds 
There are 2 sets of data files testn.txt and fixn.txt. n is the number of vertices in each class for each graph created in the file. The first set contains files created before my last fix is implemented. The second contains files created after the fix (see report for details).

Source code listing

updated thursday 16th december 1999