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):
Displaying 14 items.
- The square of a block graph (Q965949) (← links)
- Minimal vertex separators of chordal graphs (Q1281392) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- Linear-time algorithms for tree root problems (Q2346968) (← links)
- \(k\)-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
- One-phase algorithm for the determination of minimal vertex separators of chordal graphs (Q3002552) (← links)
- (Q4551369) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- (Q5121937) (← links)
- Linear separation of connected dominating sets in graphs (Q5225055) (← links)
- (Q5743514) (← links)
- (Q5874479) (← links)
- Some results on connected vertex separators (Q6040587) (← links)