A graph is a mathematical object used to model relations over a set of elements. It is used in numerous fields for modeling purposes. The size and complexity of graphs manipulated today call a need for visualization to better analyze them. In that thesis, we introduce diff erent works in interactive graph visualisation which aim at exploiting parallel computing architectures (CPU and GPU) available on contemporary workstations. A first set of works focuses on graph drawing problems. Drawing a graph consists of embedding him in a plane or a space. The first contribution in that theme is an edge bundling algorithm named Winding Roads. That intuitive, easyly implementable and parallelizable algorithm allows to considerably reduce clutter due to numerous edge crossings in a graph drawing. The second contribution is a method to draw a complete metabolic network. That kind of network models the whole set of biochemical reactions occurring within cells of a living organism. The advantage of the method is to take into account the decomposition of the network into functionnal subsets but also to respect biological drawing conventions. A second set of works focuses on computer graphics techniques for interactive graph visualisation. The fi rst contribution in that theme is a technique for rendering parametric curves that fully exploits the graphical processor unit. The second contribution is a rendering technique named Edge splatting that allows to visualize the bundles densities in an edge bundled layout. The last contribution introduces some techniques for emphasizing sub-graphs of interest in the global context of a graph visualization.
