Download
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.
Categories
MathematicsLicense
GNU General Public License version 2.0 (GPLv2)Follow rw
Other Useful Business Software
Stop Cyber Threats with VM-Series Next-Gen Firewall on Azure
Gain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of rw!
