Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

GD

2004

Springer

2004

Springer

It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods inﬂuenced by recent developments in the modeling of such graphs. Our main approach is to partition the edge set of a graph into “local” edges and “global” edges, and to use a force-directed method that emphasizes the local edges. We show that our drawing method works well for graphs that contain underlying geometric graphs augmented with random edges, and demonstrate the method on a few examples. We deﬁne edges to be local or global depending on the size of the maximum short ﬂow between the edge’s endpoints. Here, a short ﬂow, or alternatively an -short ﬂow, is one composed of paths whose length is at most some constant . We present fast approximation algorithms for the maximum short ﬂow problem, and for testing whether a short ﬂow of a certain size exists between given vertices. Using these algorithms, we give a f...

Related Content

Added |
01 Jul 2010 |

Updated |
01 Jul 2010 |

Type |
Conference |

Year |
2004 |

Where |
GD |

Authors |
Reid Andersen, Fan R. K. Chung, Lincoln Lu |

Comments (0)