Pages that link to "Item:Q1422436"
From MaRDI portal
The following pages link to A note on computing graph closures (Q1422436):
Displaying 6 items.
- On the computational complexity of graph closures (Q1351617) (← links)
- On graph closures (Q1408872) (← links)
- A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices (Q2027889) (← links)
- A formal context for closures of acyclic hypergraphs (Q2294563) (← links)
- A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)