A Simpler NP-Hardness Proof for Familial Graph Compression
Ammar Ahmed, Zohair Raza Hassan, Mudassir Shabbir
TL;DR
This paper provides a simplified proof demonstrating that the problem of Familial Graph Compression is NP-hard, highlighting its computational complexity.
Contribution
It introduces a more straightforward NP-hardness proof for Familial Graph Compression, improving understanding of its computational difficulty.
Findings
Familial Graph Compression is NP-hard
The proof simplifies previous complexity demonstrations
Highlights the problem's computational intractability
Abstract
This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Optimization and Search Problems · semigroups and automata theory