Pages that link to "Item:Q708222"
From MaRDI portal
The following pages link to Treewidth and minimum fill-in on permutation graphs in linear time (Q708222):
Displaying 4 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
