Pages that link to "Item:Q2450661"
From MaRDI portal
The following pages link to An efficient representation of chordal graphs (Q2450661):
Displaying 15 items.
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- On the representation of triangulation graphs in trees (Q794674) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- An implicit representation of chordal comparability graphs in linear time (Q972319) (← links)
- Efficient graph representations (Q1396949) (← links)
- Transchordal graphs (Q1567619) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- Clique representations and dimension-\(k\) chordal graphs (Q2721328) (← links)
- Improved algorithms for weakly chordal graphs (Q2944551) (← links)
- (Q3348013) (← links)
- (Q3737470) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- (Q5121937) (← links)
- Toughness and Hamiltonicity of strictly chordal graphs (Q6070991) (← links)
- A new characterization of \(k\)-trees and some applications (Q6552676) (← links)