Treewidth and Pathwidth of Permutation Graphs
Work
Year: 1995
Type: article
Abstract: In this paper, we show that the treewidth and pathwidth of a permutation graph can be computed in polynomial time. In fact we show that, for permutation graphs, the treewidth and pathwidth are equal. ... more
Institutions Utrecht University, Friedrich Schiller University Jena
Cites: 32
Cited by: 111
Related to: 10
FWCI: 5.768
Citation percentile (by year/subfield): 96.49
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green