The following pages link to (Q3806672):
Displaying 3 items.
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
- Minimal elimination ordering for graphs of bounded degree (Q5957302) (← links)
