5889 search results - page 35 / 1178 » Graph Layout Problems |
159
click to vote
COCOON
2003
Springer
15 years 11 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...
153
click to vote
IV
2002
IEEE
15 years 11 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....
168
click to vote
ICDAR
2009
IEEE
15 years 3 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...
163
click to vote
ICSM
2005
IEEE
15 years 11 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...
144
click to vote
GD
2006
Springer
15 years 9 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...