Now showing items 1-1 of 1
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
(Dagstuhl Publishing, 2011)
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop ...