Open Hub
Black Duck Open Hub

Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

rankwidth

Compare

  No analysis available

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 ... [More] 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. [Less]

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
0 Reviews
I Use This
Mostly written in language not available
Licenses: No declared licenses
Tags c graphs graphtheory rank-decomposition rank-width

fkt

Compare

  Analyzed 6 minutes ago

An implementation of the FKT algorithm for counting the number of perfect matchings in a graph. Written using the Gforth programming language.

5.16K lines of code

0 current contributors

almost 3 years since last commit

0 users on Open Hub

Inactive
0.0
 
0 Reviews
I Use This
Mostly written in Forth
Licenses: gpl3_or_l...
Tags algorithms counting forth gforth graphtheoreticalproblems graphtheory lattices math

Groove

Compare

  Analyzed about 24 hours ago

Graph transformation, model transformation, object-oriented verification, behavioural semantics

263K lines of code

0 current contributors

2 months since last commit

0 users on Open Hub

Very Low Activity
0.0
 
0 Reviews
I Use This
Mostly written in Java
Licenses: No declared licenses
Tags graph graphtheory graph_transformation gxl scientific software_development