Pith. sign in

Title resolution pending

· 2017

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

CONDITIONAL 1

representative citing papers

An algorithm for destroying claws and diamonds

cs.DS · 2019-08-20 · conditional · novelty 6.0

A branching algorithm for destroying claws and diamonds in a graph runs in O*(3.562^k) time, improving the previous O*(3.792^k) bound.

citing papers explorer

Showing 1 of 1 citing paper.

  • An algorithm for destroying claws and diamonds cs.DS · 2019-08-20 · conditional · none · ref 3

    A branching algorithm for destroying claws and diamonds in a graph runs in O*(3.562^k) time, improving the previous O*(3.792^k) bound.