2 papers
cs.DS2026
Terminal Steiner tree problem : Complexity and Algorithms
Jyothish S, Sadagopan Narasimhan
Given a connected graph and a terminal set , the Steiner tree problem (ST) asks for a tree that spans all of with at most vertices from $V(G)\backslas…
cs.DM2026
Dichotomy study of the Steiner tree problem in split-like graphs
Jyothish S, Sadagopan Narasimhan
Given a connected graph and a terminal set , the minimum Steiner tree problem (ST) asks for a tree that spans all of with at most vertices from $V(G)\…