Pages that link to "Item:Q819824"
From MaRDI portal
The following pages link to A vertex incremental approach for maintaining chordality (Q819824):
Displaying 13 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- Minimal comparability completions of arbitrary graphs (Q2476257) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Contracting chordal graphs and bipartite graphs to paths and trees (Q5891098) (← links)
- Computing and listing avoidable vertices and paths (Q6185944) (← links)
