Mathematica has great operations for analyzing graphs but when the graphs are a bit bigger, Gephi seems to be more efficient (at least on my computer) at drawing and analyzing, i.e. visualizing the graph. So my question is:
What is the "best practice" (white papers, web pages or similar) for how to divide the work between Mathematica and Gephi?
Here is an example, I have a graph from an analysis of all offerings and the biggest clients of a midsize telecom operator, if a client has been invoiced for the offering, there is an edge between the client and the offering. The bipartite graph (see http://mathworld.wolfram.com/BipartiteGraph.html) has about 540 nodes (clients and offerings) and about 14900 edges.

In the image - Gephi visualization of "Force Atlas" layout - you see that the core offerings gravitate to the middle. Clients (blue nodes) become grouped around some key offerings (name of clients are removed), e.g. in the upper right corner of the graph you have all the multinationals that are buying international calls and data offerings.
Seeing the clients and offerings in this way is useful for reasoning around a number of business questions such as market segmentation, bundling of offerings, solution building and reasoning around strategic options.
Background
I started doing the experiments in Gephi but after learning more about Mathematica, I would like move more of the work (if not all) to this environment.
However, importing the graph to Mathematica using .gml file from Gephi failed for me. The symptom was that the evaluation of the Import function in Mathematica failed to terminate.
The reason for wanting to import to Mathematica is for more control of normalizing data, annotations, analysis, and simulations based on the graph. This cannot be done in Gephi.
Same question posted on the Gephi forum Gephi - MMA
Miscellaneous notes
Gephi (or similar programs) seems to be faster than Mathematica for the visualization.
Key points for using Gephi initially was the ability to handle the large amount of nodes and edged and the layout algorithms. The "tags" that seem to be relevant for finding our more are: