Pith. sign in

Title resolution pending

Florian Adriaens, Tijl De Bie, Aristides Gionis, Jefrey Lijffijt, Antonis Matakos, Polina Rozenshtein · 2020

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

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Dense Subgraph Discovery Meets Strong Triadic Closure

cs.DS · 2025-02-03 · conditional · novelty 6.0

The paper introduces STC-DEN, a density score that interpolates between maximum clique and densest subgraph, proves it NP-hard for lambda<1, and provides ILP and heuristic solvers.

citing papers explorer

Showing 1 of 1 citing paper.

  • Dense Subgraph Discovery Meets Strong Triadic Closure cs.DS · 2025-02-03 · conditional · none · ref 1

    The paper introduces STC-DEN, a density score that interpolates between maximum clique and densest subgraph, proves it NP-hard for lambda<1, and provides ILP and heuristic solvers.