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

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

Bonnet, Édouard et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
68q25combinatoricscomputationalcomplexitydatastructuresandalgorithmsdiscretemathematics
computational complexity, discrete mathematics, data structures and algorithms, combinatorics, 68q25, f.2.2
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 998825
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.