Pages that link to "Item:Q1108003"
From MaRDI portal
The following pages link to Chordal graph recognition is in NC (Q1108003):
Displaying 4 items.
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
