Blar i Department of Informatics på emneord "Sparse graphs"
Viser treff 1-1 av 1
-
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
(Peer reviewed; Journal article, 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 ...