Pages that link to "Item:Q1156488"
From MaRDI portal
The following pages link to A sensitive transitive closure algorithm (Q1156488):
Displayed 5 items.
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- An efficient database transitive closure algorithm (Q1330412) (← links)
- An efficient transitive closure algorithm for cyclic digraphs (Q1341684) (← links)
- An improved transitive closure algorithm (Q1836309) (← links)
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)