Pages that link to "Item:Q5048948"
From MaRDI portal
The following pages link to Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948):
Displaying 6 items.
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
- The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) (← links)
- An efficient representation of chordal graphs (Q2450661) (← links)
- (Q4730797) (← links)
- Minimal elimination ordering for graphs of bounded degree (Q5957302) (← links)