Monoidal width was recently introduced by the authors as a measure of complexity decomposing morphisms in monoidal categories. We have shown that category cospans graphs, and its variants can be used to capture tree width, path branch width. In this paper we study matrices, an extension different open where connectivity information is handled with matrix algebra graphs are composed along edges ...

We construct a polynomial-time algorithm to approximate the branch-width of certain symmetric submodular functions, and give two applications. The first is to graph “clique-width”. Clique-width is a measure of the difficulty of decomposing a graph in a kind of tree-structure, and if a graph has clique-width at most k then the corresponding decomposition of the graph is called a “k-expression”. ...

There are several reasons why this book might be of interest to a TEX user. First, LTEX has a prominent place in the book. Second, the book describes a very interesting offshoot of literate programming, a topic traditionally popular in the TEX community. Third, since a number of TEX users work with data analysis and statistics, R could be a useful tool for them. Since some TUGboat readers are l...