A Simpler NP-Hardness Proof for Familial Graph Compression

09/07/2020
by   Ammar Ahmed, et al.
0

This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro