Pith. sign in

Title resolution pending

· 2019

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DM 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

How Difficult Is It to Recognize CIS Graphs?

cs.DM · 2026-08-11 · conditional · novelty 8.0

Recognizing CIS graphs is coNP-complete, proved by a polynomial reduction from 3SAT to the complement of the recognition problem.

citing papers explorer

Showing 1 of 1 citing paper.

  • How Difficult Is It to Recognize CIS Graphs? cs.DM · 2026-08-11 · conditional · none · ref 1

    Recognizing CIS graphs is coNP-complete, proved by a polynomial reduction from 3SAT to the complement of the recognition problem.