D. Vrajitoru, Intelligent Syst. Lab., Indiana Univ., South Bend, IN, USA
J. DeBoni, Intelligent Syst. Lab., Indiana Univ., South Bend, IN, USA
Summary form only given. In this paper, we present three algorithms that build graph layouts for undirected, weighted graphs. Our goal is to generate layouts that are consistent with the weights in the graph. We introduce tree algorithms and show that they can be successful in solving the problem up to a certain precision.