A Simpler NP-Hardness Proof for Familial Graph Compression
Abstract
This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.