Pith. sign in

Title resolution pending

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

1 Pith paper citing it

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Edge Clique Partition and Cover Beyond Independence

cs.DS · 2025-06-26 · conditional · novelty 7.0

For edge clique partition and cover parameterized above the independence number, the paper gives an FPT algorithm for the partition variant, an NP-completeness dichotomy for the cover variant, and FPT algorithms on bounded-clique, degenerate, and minor-free graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Edge Clique Partition and Cover Beyond Independence cs.DS · 2025-06-26 · conditional · none · ref 8

    For edge clique partition and cover parameterized above the independence number, the paper gives an FPT algorithm for the partition variant, an NP-completeness dichotomy for the cover variant, and FPT algorithms on bounded-clique, degenerate, and minor-free graphs.