Pages that link to "Item:Q1341730"

The following pages link to An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730):

Displaying 3 items.

• Minimal triangulations of graphs: a survey (Q819823) (← links)
• Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
• Minimal elimination of planar graphs (Q5054857) (← links)