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.

Project Activity

See All Activity >

Categories

Mathematics

License

GNU General Public License version 2.0 (GPLv2)

Follow rw

rw Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

Build gen AI apps with an all-in-one modern database: MongoDB Atlas

MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of rw!

Additional Project Details

Intended Audience

Science/Research

Programming Language

C

Related Categories

C Mathematics Software

Registered

2016-08-10