Sciweavers

515 search results - page 33 / 103
» Layouts of Expander Graphs
Sort
View
83
Voted
IV
2002
IEEE
85views Visualization» more  IV 2002»
15 years 5 months ago
Fillets: Cues for Connections in Focus+Context Views of Graph-Like Diagrams
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....
Tuomas J. Lukka, Janne V. Kujala, Marketta Niemel&...
112
Voted
ICDAR
2009
IEEE
14 years 10 months ago
Graph b-Coloring for Automatic Recognition of Documents
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...
Djamel Gaceb, Véronique Eglin, Frank Lebour...
110
Voted
ICSM
2005
IEEE
15 years 6 months ago
Co-Change Visualization
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...
Dirk Beyer
87
Voted
GD
2006
Springer
15 years 4 months ago
Improved Circular Layouts
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...
Emden R. Gansner, Yehuda Koren
SIROCCO
2004
15 years 2 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein