Pith. sign in

Theo retical Computer Sci- ence 1032, 115088 (2025), conference version in Proc

Brettell, N · 2025

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

1 Pith paper citing it
browse 1 citing papers

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Finding $d$-Cuts in Probe $H$-Free Graphs

cs.DS · 2025-05-28 · conditional · novelty 7.0

Complete complexity dichotomies are proven for d-Cut, Perfect Matching Cut, and Maximum Matching Cut on partitioned probe H-free graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Finding $d$-Cuts in Probe $H$-Free Graphs cs.DS · 2025-05-28 · conditional · none · ref 6

    Complete complexity dichotomies are proven for d-Cut, Perfect Matching Cut, and Maximum Matching Cut on partitioned probe H-free graphs.