An Efficient Algorithm to Compute a Steiner Set and Steiner Tree on Trapezoid Graphs

Abstract

[[abstract]]This paper presents an ecient algorithm to compute a minimum cardinality Steiner set and Steiner tree on trapezoid graphs. The algo- rithm takes O(m+n p log C) time for a trapezoid graph with n vertices and m edges, where cost of each arc is a non-negative integer number bounded by C