Dataset - CKAN

On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem

Given a bipartite graph G = (U υ V,E) such that |U| = |V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine...
- HTML

You can also access this registry using the API (see API Docs).