Consistent graph layout for weighted graphs

Authors:
D. Vrajitoru;J. DeBoni
Affiliations:
Intelligent Syst. Lab., Indiana Univ., South Bend, IN, USA;Intelligent Syst. Lab., Indiana Univ., South Bend, IN, USA
Venue:
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
Year:
2005

Citing 0
Cited 2

Hybrid real-coded mutation for genetic algorithms applied to graph layouts

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Hybrid multiobjective optimization genetic algorithms for graph drawing

Proceedings of the 9th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.