Conceptio › Archive › arXiv (All)
arXiv (All)open access

NP-Hardness of the $H$-Free Edge-Deletion Problem

Gishboliner, Lior et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
combinatoricscomputational-complexity
combinatorics, computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 996542
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.