326 search results - page 40 / 66 » A Library of Algorithms for Graph Drawing |
GD
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
PC
2007
14 years 9 months ago
2007
The Sony–Toshiba–IBM Cell Broadband Engine (Cell/B.E.) is a heterogeneous multicore architecture that consists of a traditional microprocessor (PPE) with eight SIMD co-process...
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
STACS
1991
Springer
15 years 1 months ago
1991
Springer
Several relation-algebraic algorithms for computing the cut completion of a partially ordered set are formally developed and afterwards generalized to the case of concept lattices....
GD
2006
Springer
15 years 1 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...