Project scheduling is concerned with single-item or small batch production where scarce
resources have to be allocated to dependent activities over time. Applications can be found …

The study of graph structure has advanced in recent years with great strides: finite graphs
can be described algebraically, enabling them to be constructed out of more basic elements …

Publisher Summary This chapter presents three mathematical tools that can be used to
describe graph-grammars and the sets generated by them. The chapter describes graph …

This survey provides a description of algorithms to reorder visual matrices of tabular data
and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list …

This book is written based on my class notes developed while teaching the undergraduate
graph theory course “Basic Graph Theory” at the Department of Computer Science and …

With the advent of volumetric EM techniques, large connectomic datasets are being created,
providing neuroscience researchers with knowledge about the full connectivity of neural …

We relate the tree-decompositions of hypergraphs introduced by Robertson and Seymour to
the finite and infinité algebraic expressions introduced by Bauderon and Courcelle. We …

This is the fifth edition of a quarterly column the purpose of which is to provide continuing
coverage of new developments in the theory of NP-completeness. The presentation is …

The classical Feferman–Vaught Theorem for First Order Logic explains how to compute the
truth value of a first order sentence in a generalized product of first order structures by …

Context-free graph-grammars are considered such that, in every generated graph G, a
derivation tree of G can be constructed by means of monadic second-order formulas that …