Pages that link to "Item:Q1392207"
From MaRDI portal
The following pages link to On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207):
Displaying 18 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Computing hypergraph width measures exactly (Q437685) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Minimal split completions (Q967310) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- An integer programming model for the Minimum Interval Graph Completion Problem (Q2883618) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
