pith. machine review for the scientific record. sign in

3 Toru Araki

XII Latin-American Algorithms, Graphs, Optimization Symposium (LAGOS · 2023 · DOI 10.1016/j.procs.2023.08.232

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

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Completely Independent Steiner Trees

cs.DM · 2026-04-21 · unverdicted · novelty 8.0

Completely independent Steiner trees are defined as a generalization of completely independent spanning trees and internally disjoint Steiner trees, accompanied by characterizations, bounds, algorithms, hardness results, and applications to planar graphs and bounded-treewidth graphs plus a directed-

citing papers explorer

Showing 1 of 1 citing paper.

  • Completely Independent Steiner Trees cs.DM · 2026-04-21 · unverdicted · none · ref 2

    Completely independent Steiner trees are defined as a generalization of completely independent spanning trees and internally disjoint Steiner trees, accompanied by characterizations, bounds, algorithms, hardness results, and applications to planar graphs and bounded-treewidth graphs plus a directed-