5889 search results - page 35 / 1178 » Graph Layout Problems |
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an abili...
IV
2002
IEEE
14 years 2 months ago
2002
IEEE
We apply fillets — smoothing of sharp angles at the joints — between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e....
ICDAR
2009
IEEE
13 years 7 months ago
2009
IEEE
In order to reduce the rejection rate of our automatic reading system, we propose to pre-classify the business documents by introducing an Automatic Recognition of Documents stage...
ICSM
2005
IEEE
14 years 3 months ago
2005
IEEE
Clustering layouts of software systems combine two important aspects: they reveal groups of related artifacts of the software system, and they produce a visualization of the resul...
GD
2006
Springer
14 years 1 months ago
2006
Springer
Circular graph layout is a drawing scheme where all nodes are placed on the perimeter of a circle. An inherent issue with circular layouts is that the rigid restriction on node pla...