Pages that link to "Item:Q819826"
From MaRDI portal
The following pages link to A linear time algorithm to list the minimal separators of chordal graphs (Q819826):
Displayed 8 items.
- The square of a block graph (Q965949) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- <i>k</i>-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- (Q5743514) (← links)
- Some results on connected vertex separators (Q6040587) (← links)