Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.

Daniel Meister Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. 91-102 2005 conf/wg/2005 WG http://dx.doi.org/10.1007/11604686_9 db/conf/wg/wg2005.html#Meister05