Project Summary
rw calculates rank-width and rank-decompositions. It is based on ideas from "Computing rank-width exactly" by Sang-il Oum, "Sopra una formula numerica" by Ernesto Pascal, "Generation of a Vector from the Lexicographical Index" by B.P. Buckles and M. Lybanon and "Fast additions on masked integers" by Michael D. Adams and David S. Wise.
On 2009's computers it works quite well up to graph sizes of about 28 nodes. Runtime and memory usage are exponential in the graph size.
In a Nutshell, rankwidth...
Quick Reference
svn://svn.code.sf.net/p/rankwidt...
This Project has No vulnerabilities Reported Against it
Did You Know...
-
...
55% of companies leverage OSS for production infrastructure
-
...
check out hot projects on the Open Hub
-
...
use of OSS increased in 65% of companies in 2016
-
...
search using multiple tags to find exactly what you need