A Simpler NP-Hardness Proof for Familial Graph Compression
Computational Complexity
2020-09-08 v1
Abstract
This document presents a simpler proof showcasing the NP-hardness of Familial Graph Compression.
Cite
@article{arxiv.2009.02945,
title = {A Simpler NP-Hardness Proof for Familial Graph Compression},
author = {Ammar Ahmed and Zohair Raza Hassan and Mudassir Shabbir},
journal= {arXiv preprint arXiv:2009.02945},
year = {2020}
}
Related papers
View all related →
Computational Complexity · Computer Science
Determining the Outerthickness of Graphs Is NP-Hard
Pin-Hsian Lee, Te-Cheng Liu, Meng-Tsung Tsai
2026-02-10
Computational Geometry · Computer Science
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
Tim Dwyer, Christopher Mears, Kerri Morgan, Todd Niven +2
2013-11-28
Combinatorics · Mathematics
On NP-hard graph properties characterized by the spectrum
Omid Etesami, Willem H. Haemers
2020-01-28
Computational Complexity · Computer Science
A More Complicated Hardness Proof for Finding Densest Subgraphs in Bounded Degree Graphs
Manuel Sorge
2013-06-28
Discrete Mathematics · Computer Science
The complexity of recognizing minimally tough graphs
Gyula Y Katona, István Kovács, Kitti Varga
2022-09-02
Computational Complexity · Computer Science
Minimum Bisection is NP-hard on Unit Disk Graphs
Josep Diaz, George B. Mertzios
2017-04-28
Computational Complexity · Computer Science
On Computation Complexity of True Proof Number Search
Chao Gao
2021-02-10
Computational Complexity · Computer Science
Dense Graph Partitioning on sparse and dense graphs
Cristina Bazgan, Katrin Casel, Pierre Cazals
2022-02-17
Combinatorics · Mathematics
Hardness and Structural Properties of Fuzzy Edge Contraction
Shanookha Ali
2025-09-22
Combinatorics · Mathematics
A combinatorial proof of Rayleigh monotonicity for graphs
J. Cibulka, J. Hladky, M. A. LaCroix, D. G. Wagner
2017-07-31
Computational Geometry · Computer Science
Finding Geometric Representations of Apex Graphs is NP-Hard
Dibyayan Chakraborty, Kshitij Gajjar
2021-06-03
Computational Complexity · Computer Science
Strengthening Hardness Results to 3-Connected Planar Graphs
Giordano Da Lozzo, Ignaz Rutter
2016-07-11
Social and Information Networks · Computer Science
An Empirical Study of Compression-friendly Community Detection Methods
Muhammad Irfan Yousuf, Izza Anwer, Muhammad Abid
2021-05-13
Computational Complexity · Computer Science
A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems
Hans-Jörg Kreowski, Sabine Kuske, Aaron Lye, Aljoscha Windhorst
2022-12-23
Computational Geometry · Computer Science
Minimum-Complexity Graph Simplification under Fr\'echet-Like Distances
Omrit Filtser, Majid Mirzanezhad, Carola Wenk
2021-11-05
Logic in Computer Science · Computer Science
Proof compression and NP versus PSPACE. Part 2
Lev Gordeev
2022-01-11
Computational Complexity · Computer Science
Approximation Hardness of Graphic TSP on Cubic Graphs
Marek Karpinski, Richard Schmied
2013-05-15
Computational Complexity · Computer Science
Hardness of the Generalized Coloring Numbers
Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan
2023-03-17
Computational Complexity · Computer Science
On the Parameterised Complexity of Induced Multipartite Graph Parameters
Ryan L. Mann, Luke Mathieson, Catherine Greenhill
2023-05-05
Combinatorics · Mathematics
Naji's characterization of circle graphs
Jim Geelen, Edward Lee
2023-11-14
Computational Complexity · Computer Science
Reducibility among NP-Hard graph problems and boundary classes
Syed Mujtaba Hassan, Shahid Hussain, Abdul Samad
2025-08-11
Combinatorics · Mathematics
An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
Vahan Mkrtchyan
2025-10-15
Computational Complexity · Computer Science
NP-hardness of the cluster minimization problem revisited
A. B. Adib
2009-11-11
Computational Geometry · Computer Science
On the complexity of embedding in graph products
Therese Biedl, David Eppstein, Torsten Ueckerdt
2026-01-21
Computational Geometry · Computer Science
Link Crossing Number is NP-hard
Arnaud de Mesmay, Marcus Schaefer, Eric Sedgwick
2019-08-13