On the computational complexity of graph closures
From MaRDI portal
Publication:1351617
DOI10.1016/0020-0190(96)00027-0zbMATH Open0875.68543OpenAlexW2015601981MaRDI QIDQ1351617
Author name not available (Why is that?)
Publication date: 27 February 1997
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(96)00027-0
No records found.
No records found.
This page was built for publication: On the computational complexity of graph closures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1351617)
