Pages that link to "Item:Q1075771"

The following pages link to An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771):

Displaying 2 items.

• Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)