Can graph and graphviz do all this? in a generic non-biological way?
* General Algorithms:
o a planarity test and an embedding computation algorithm using
Fraysseix-Rosenstiehl left-right algorithm [3,5,6]
(probably the fastest planarity test [27]),
o a linear time algorithm to locate a Kuratowski subdivision or a
cotree critical partial subgraph in a non planar graph [4,21,24],
o a linear time 3-connexity test for planar graphs [19,20],
o a linear time recognition algorithm for subdivisions of
3-connected planar graphs ([19]),
o a linear time 4-connexity test for maximal planar graphs [19],
o a fast Depth-First Search algorithm (unpublished),
o fast bipolar and regular orientation algorithms for planar graphs
[16],
o a linear time optimal triangulation algorithm for 3-connected
planar graphs increasing the degrees by at most 6 [15],
o a partitioner algorithm based on factorial analysis [13].
* Drawing Algorithms:
o optimized Fary drawing algorithms [8-11] relying on new planar
augmentation algorithms [15], i.e.:
+ Fraysseix, Pach Pollack algorithm,
+ Schnyder algorithm using our triangulation algorithms,
+ Schnyder algorithm using a vertex triangulation,
+ Tutte barycentric representation of 3-connected graphs,
+ A Fary representation derived from the Tutte algorithm,
+ A spring embedder which preserves the map, (unpublished).
o visibility representation of planar graphs [7],
o a drawing of planar graphs using B�ziers curves (based on a spring
embedder, unpublished),
o an algorithm to represent 2-connected planar bipartite graphs as
the incidence graph of horizontal and vertical segments [12,16],
o an algorithm to represent planar graphs by contacts of T [14],
o An algorithm to represent a graph in R3, as projections of
different embeddings of the graph in Rn-1 [13].
* Experimental Algorithms:
o an heuristic to detect symmetries [18],
o an heuristic to find a maximal planar partial graph of a non
planar graph (unpublished).
On June 1, 2005 07:50 pm, M. Edward (Ed) Borasky wrote:
> Just out of curiosity, what does pigale do that can't be done using the
> Bioconductor "graph" package for R and "graphviz"? R and graphviz are
> already in Portage, and once you've got those, you can install the
> Bioconductor package and you're on the air. Of course, you'd need to
> learn R programming, but that's a worthwhile endeavor. :)
>
> Matias Grana wrote:
> >Hi;
> >I'm new to gentoo and I don't know yet how soft gets included to the
> >portage. I've just downloaded and built pigale:
> >http://sourceforge.net/projects/pigale/
> >It looks like a very good program to deal with graphs (as in "graph
> >theory", not as in "function graph"). Any chance this could make into
> >portage?
> >
> >Thanks!
> >Matias Gra�a
> >[EMAIL PROTECTED]
--
David J. Grant
http://www.davidandnasha.ca
--
[email protected] mailing list
