Pages that link to "Item:Q4215725"
From MaRDI portal
The following pages link to Treewidth and Minimum Fill-in on d-Trapezoid Graphs (Q4215725):
Displayed 19 items.
- Graph classes with structured neighborhoods and algorithmic applications (Q392023) (← links)
- Efficient algorithm for the vertex connectivity of trapezoid graphs (Q396607) (← links)
- Edge search number of cographs (Q415273) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs (Q477692) (← links)
- Approximation of RNA multiple structural alignment (Q655441) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs (Q1962057) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs (Q2445238) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)