Paketti: librw-dev (0.9+ds1-1 ja muut) [debports]

[ Source:  ]

Compute rank-width and rank-decompositions of graphs (development)

Compute rank-width and rank-decompositions of graphs. 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.

This package contains the development files for the library.

Muut pakettiin librw-dev liittyvät paketit

• dep: librw0 (= 0.9+ds1-1+b1)

  Compute rank-width and rank-decompositions of graphs

Imuroi librw-dev

Imurointi kaikille saataville arkkitehtuureille

Arkkitehtuuri	Versio	Paketin koko	Koko asennettuna	Tiedostot
m68k (epävirallinen siirros)	0.9+ds1-1+b1	4.2 kt	18.0 kt	[tiedostoluettelo]