REVIEW 1 cited by
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced subgraphs. We show a dichotomy for the former problem restricted to $(H_1,H_2)$-free graphs and a dichotomy for the latter problem restricted to $H$-free graphs. We find that there exists an infinite family of graphs $H$ such that Vertex Steiner Tree is polynomial-time solvable for $H$-free graphs, whereas there exist only two graphs $H$ for which this holds for Edge Steiner Tree. We also find that Edge Steiner Tree is polynomial-time solvable for $(H_1,H_2)$-free graphs if and only if the treewidth of the class of $(H_1,H_2)$-free graphs is bounded (subject to P $\neq$ NP). To obtain the latter result, we determine all pairs $(H_1,H_2)$ for which the class of $(H_1,H_2)$-free graphs has bounded treewidth.
Forward citations
Cited by 1 Pith paper
-
TriMod Fusion for Multimodal Named Entity Recognition in Social Media
A text-image-hashtag attention fusion model for Twitter named entity recognition reports a marginal F1 gain over prior work, but the result is not reproducible from the paper.
Discussion (0). Continue with ORCID to comment.