Sciweavers

365 search results - page 12 / 73
» Reconfigurations in Graphs and Grids
Sort
View
APCSAC
2003
IEEE
15 years 5 months ago
Mapping Applications to a Coarse Grain Reconfigurable System
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Mi...
PPL
2000
91views more  PPL 2000»
14 years 11 months ago
A Parallel Algorithm for Planar Orthogonal Grid Drawings
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
Roberto Tamassia, Ioannis G. Tollis, Jeffrey Scott...
COCOON
1999
Springer
15 years 4 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
CORR
2002
Springer
115views Education» more  CORR 2002»
14 years 11 months ago
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...
Cesim Erten, Stephen G. Kobourov
GRID
2008
Springer
14 years 11 months ago
ADL: An Algorithm Definition Language for SmartGridSolve
SmartGridSolve is an extension of GridSolve that expands the single task map and client-server model of GridRPC by implementing server to server communication and the mapping of a...
Michele Guidolin, Alexey L. Lastovetsky