101
Voted
SIAMCOMP
2008
15 years 2 months ago
2008
We show that the treewidth and the minimum fill-in of an n-vertex graph can be
88
Voted
DAM
2010
15 years 2 months ago
2010
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...