Title of article :
On the computational complexity of graph closures
Author/Authors :
Angelo Monti، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1996
Keywords :
computational complexity , Graph closure , P-completeness , parallel complexity
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
