Pages that link to "Item:Q1075771"
From MaRDI portal
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 16 items.
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Determining connected components in linear time by a linear number of processors (Q1108033) (← links)
- Transitive closure for restricted classes of partial orders (Q1182064) (← links)
- On finding the strongly connected components in a directed graph (Q1313703) (← links)
- Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
- An efficient database transitive closure algorithm (Q1330412) (← links)
- Algorithms for transitive closure (Q1603584) (← links)
- Algorithms for dense graphs and networks on the random access computer (Q1918989) (← links)
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889) (← links)
- Efficient transitive closure of sparse matrices over closed semirings (Q2368941) (← links)
- An iterative algorithm of computing the transitive closure of a union of parametrized affine integer tuple relations (Q2905312) (← links)
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348) (← links)
- Complexité de problèmes liés aux graphes sans circuit (Q3773334) (← links)
- (Q5091535) (← links)
- (Q5365129) (← links)
