A Simpler NP-Hardness Proof for Familial Graph Compression

preprint2020arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.