pith. sign in

Theoretical Computer Science 777, 243–251 (Jul 2019)

Dondi, R · 2019 · DOI 10.1016/j.tcs.2019.03.045

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

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.CC 1

years

2024 1

verdicts

UNVERDICTED 1

representative citing papers

Disjoint covering of bipartite graphs with $s$-clubs

cs.CC · 2024-09-23 · unverdicted · novelty 6.0

Establishes fixed-parameter NP-completeness for (k,s)-partition into s-clubs on bipartite graphs, 95/94-inapproximability for certain (t,s)-MAX-DCC instances, and a poly-time algorithm for (2,2)-MAX-DCC.

citing papers explorer

Showing 1 of 1 citing paper.

  • Disjoint covering of bipartite graphs with $s$-clubs cs.CC · 2024-09-23 · unverdicted · none · ref 9

    Establishes fixed-parameter NP-completeness for (k,s)-partition into s-clubs on bipartite graphs, 95/94-inapproximability for certain (t,s)-MAX-DCC instances, and a poly-time algorithm for (2,2)-MAX-DCC.