A Unified Framework for Numerical and Combinatorial Computing

Large, complex graphs arise in many settings including the Internet, social networks, and communication networks. To study such data sets, the authors explored the use of high-performance computing (HPC) for graph algorithms. They found that the ...

Message-passing methods provide powerful approximation algorithms for problems that can be formulated in terms of (probabilistic) graphical models. These methods find applications in statistical physics, inference, and combinatorial optimization. Sudoku,...

Guest editors Isabel Beichl and Francis Sullivan discuss the field of combinatorics in general and the articles in this special issue in particular, highlighting the recent upsurge in research in this area as well as some interesting applications of it (...