1 paper
Jacek Ciszewski, Jakub KÅos, Maxime Jakubowski +2
The problem of validating a given graph database instance against a given PG-Schema graph type without integrity constraints is NP- complete in terms of combined complexity and in…