Sciweavers

605 search results - page 20 / 121
» Constrained Graph Layout
Sort
View
GD
2009
Springer
14 years 2 months ago
Upward Planarization Layout
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
14 years 4 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
DAC
1995
ACM
14 years 1 months ago
Automatic Layout Synthesis of Leaf Cells
––This paper describes algorithms for automatic layout synthesisofleafcellsin1–dandinanew1–1/2–dlayoutstyle,useful for non–dual circuit styles. The graph theory based a...
Sanjay Rekhi, J. Donald Trotter, Daniel H. Linder
IWPC
2005
IEEE
14 years 3 months ago
Clustering Software Artifacts Based on Frequent Common Changes
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsyst...
Dirk Beyer, Andreas Noack
ISCI
2007
96views more  ISCI 2007»
13 years 9 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao