Pages that link to "Item:Q1026107"
From MaRDI portal
The following pages link to Dynamically maintaining split graphs (Q1026107):
Displaying 4 items.
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
