Graph representation compress

Hi theory guru! I am interested in compress large (spare/complete)
(static/dynamic) graph model representation. What data structures
helps to represent graph with 10.000.000 and more vertexes as compress
as possible. And what data structures provide high performance factor
for such graphs?
Maybe, it ll be coded adjacency matrix or map/multimap, sets or hash
table..?
.

Relevant Pages

  • Re: Representing structures for simulations
    ... Lists are ideal when you want to accumulate a sequence of elements ... > Queues are data structures where the first entry is ... > Trees order data in branching clusters, ... I would call that a graph. ...
    (comp.lang.fortran)
  • Re: OOP and memory management
    ... > Look at a program in Java, the garbage-collected language with which we ... When the program manipulates a graph as in ... data structures that correspond to my example. ...
    (comp.programming)
  • Re: Project dream
    ... I've wondered about Boost. ... and Boost includes a graph library with many of the features you've ... I have two C extensions for Python which do max clique detection. ... but it needs to convert to VF's data structures before doing ...
    (comp.lang.python)
  • Re: Graph representation compress
    ... graph model representation. ... And what data structures provide high performance factor ... Maybe, it ll be coded adjacency matrix or map/multimap, sets or hash ...
    (comp.theory)
  • GetCurrentPosition in a graph that does not accept seeking
    ... Some times ago I wrote a simple filter whose task was to let me to check ... the progress in a graph that compressed a generic audio file to mp3 through ... The graph alone did not accept seeking (I only got 0 as ... Now I want to reuse the graph to compress into ogg through Vorbis Encoder. ...
    (microsoft.public.win32.programmer.directx.audio)