The following pages link to On computing graph closures (Q1120287):
Displaying 9 items.
- A note on the computation on the k-closure of a graph (Q1108040) (← links)
- On the computational complexity of graph closures (Q1351617) (← links)
- On graph closures (Q1408872) (← links)
- A note on computing graph closures (Q1422436) (← links)
- An algorithm for<i>K</i>-convex closure and an application (Q2752262) (← links)
- A New Algorithm for Computing the Maximal Closure of a Graph (Q3491289) (← links)
- Parallel computation of closure on finite subset relations (Q3977578) (← links)
- The structure and methods of generation of closed classes of graphs (Q4809638) (← links)
- Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
