Package: bliss-doc (0.73-2)

[ Source: bliss  ]

suite to compute graph automorphisms and labelings -- doc

Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs.

This package provides the API documentation.

Other Packages Related to bliss-doc

• dep: libjs-jquery

  JavaScript library for dynamic web applications

• sug: bliss (= 0.73-2)

  tool to compute graph automorphisms and labelings -- bin

• sug: pdf-viewer

  virtual package provided by atril, evince, gv, mupdf, okular, viewpdf.app, xpdf, zathura-pdf-poppler

• sug: www-browser

  virtual package provided by chromium, dillo, edbrowse, elinks, epiphany-browser, falkon, firefox-esr, hv3, konqueror, links, links2, lynx, midori, netrik, sugar-browse-activity, surf, w3m, xemacs21-mule, xemacs21-mule-canna-wnn, xemacs21-nomule

Download bliss-doc

Download for all available architectures

Architecture	Package Size	Installed Size	Files
all	267.8 kB	669.0 kB	[list of files]