Pith. sign in

Title resolution pending

· 2006 · SIAM Journal on Discrete Mathematics · DOI 10.1137/s0895480104445319

1 Pith paper cite this work, alongside 22 external citations. Polarity classification is still indexing.

1 Pith paper citing it
22 external citations · OpenAlex
open at publisher 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

Isometric-Universal Graphs for Trees

cs.DS · 2025-06-13 · conditional · novelty 7.0

The minimum isometric-universal graph for two forests can be computed in polynomial time, while the problem for three forests is NP-complete.

citing papers explorer

Showing 1 of 1 citing paper.

  • Isometric-Universal Graphs for Trees cs.DS · 2025-06-13 · conditional · none · ref 8

    The minimum isometric-universal graph for two forests can be computed in polynomial time, while the problem for three forests is NP-complete.