141 search results - page 10 / 29 » Layout Problems on Lattice Graphs |
SIROCCO
2004
13 years 11 months ago
2004
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...
GD
2004
Springer
14 years 3 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
TCAD
2010
13 years 4 months ago
2010
Abstract--In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different ex...
ISAAC
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
ICCV
2009
IEEE
13 years 7 months ago
2009
IEEE
We describe an energy minimization algorithm for functions defined on 4-connected lattices, of the type usually encountered in problems involving images. Such functions are often ...