pith. sign in

Title resolution pending

· 2018

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.DS 1

years

2019 1

verdicts

UNVERDICTED 1

representative citing papers

Algorithms for deletion problems on split graphs

cs.DS · 2019-06-24 · unverdicted · novelty 5.0

Gives FPT algorithms running in O*(2.076^k) and O*(2.733^k) time for Split to Block Vertex Deletion and Split to Threshold Vertex Deletion on split graphs.

citing papers explorer

Showing 1 of 1 citing paper.

  • Algorithms for deletion problems on split graphs cs.DS · 2019-06-24 · unverdicted · none · ref 1

    Gives FPT algorithms running in O*(2.076^k) and O*(2.733^k) time for Split to Block Vertex Deletion and Split to Threshold Vertex Deletion on split graphs.