loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ACS/IEEE 2005 International Conference on Computer Systems and Applications (AICCSA'05)
Consistent graph layout for weighted graphs
Cairo, Egypt
January 03-January 06
ISBN: 0-7803-8735-X
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.
Citation:
D. Vrajitoru, J. DeBoni, "Consistent graph layout for weighted graphs," aiccsa, pp.13-I, ACS/IEEE 2005 International Conference on Computer Systems and Applications (AICCSA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.