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 9 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)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- Minimum Fill-in on Circle and Circular-Arc Graphs (Q4209266) (← links)
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs (Q4215725) (← links)
- Treewidth and Pathwidth of Permutation Graphs (Q4863978) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)