170 search results - page 9 / 34 » On Metro-Line Crossing Minimization |
GD
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
FSTTCS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Two trees with the same number of leaves have to be embedded in two layers in the plane such that the leaves are aligned in two adjacent layers. Additional matching edges...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
DAC
2001
ACM
14 years 8 months ago
2001
ACM
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
Inductive cross-talk within IC packaging is becoming a significant bottleneck in high-speed inter-chip communication. The parasitic inductance within IC packaging causes bounce o...