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

Daniel Meister

Browse the full WG paper archive.