On the Computational Complexity of Graph Closures

Angelo Monti. On the Computational Complexity of Graph Closures. Inf. Process. Lett., 57(6):291-295, 1996. [doi]

Authors

Angelo Monti

This author has not been identified. Look up 'Angelo Monti' in Google