Re: graph layout algorithm
- From: "Joachim Pimiskern" <JoachimPimiskern@xxxxxx>
- Date: Tue, 24 Jan 2006 16:10:46 +0100
<enigma261@xxxxxxxxx> schrieb:
I am looking for graph layout algorithms. I am representing a process flow using a graph. I have the visual representation of nodes and connectors.
I would like to use a graph layout algorithm to represent this graph.
You may look at the paper
Joshua R. Tyler, Dennis M. Wilkinson, Bernardo A. Huberman:
Email as spectroscopy: automated discovery of community structure within organizations
A graph can be broken down into smaller subgraphs by repeated deletions of the edge (or the node) with the biggest "betweenness".
Regards Joachim
.
- References:
- graph layout algorithm
- From: enigma261
- graph layout algorithm
- Prev by Date: Re: Significance of "Relativizations of the P =? NP Question"
- Next by Date: Re: graph layout algorithm
- Previous by thread: graph layout algorithm
- Next by thread: Re: graph layout algorithm
- Index(es):
Relevant Pages
|