326 search results - page 34 / 66 » A Library of Algorithms for Graph Drawing |
ALGORITHMICA
2011
14 years 4 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
COCOA
2007
Springer
15 years 3 months ago
2007
Springer
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Social Network Analysis (SNA) has evolved as a popular, standard method for modeling meaningful, often hidden structural relationships in communities. Existing SNA tools often i...
103
click to vote
EUROPAR
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
GD
2006
Springer
15 years 1 months ago
2006
Springer
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....