graph arboricity or matroid partitioning code needed

From: Brian Parker (brianjparker_at_hotmail.com)
Date: 10/19/04 

Date: 18 Oct 2004 19:25:14 -0700

Hi all,

For my PhD, I need to find the arboricity (and the corresponding
forest factorization) of a graph in polynomial time. Does anyone have
example source code for this, e.g. as described in-

H. Gabow and H. Westermann "Forests, frames, and games: algorithms for
matroid sums and applications", Proceedings of the twentieth annual
ACM symposium on Theory of computing, pp 407 - 421, 1988

or
H. Gabow, "Algorithms for Graphic Polymatroids and Parametric
s-Sets", JOURNAL OF ALGORITHMS 26, 48-86 1998.

or an implementation of matroid partitioning code would also be of
assistance e.g. as described in
http://www-db.stanford.edu/TR/CS-TR-73-342.html

Thanks,
Brian Parker,
Computer Science Department,
University of Sydney,
Australia

Relevant Pages