365 search results - page 6 / 73 » Reconfigurations in Graphs and Grids |
GD
2003
Springer
15 years 5 months ago
2003
Springer
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
ICCD
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...
COMGEO
2007
ACM
14 years 11 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
FSTTCS
2005
Springer
15 years 5 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
99
Voted
WOWMOM
2006
ACM
15 years 5 months ago
2006
ACM
The cost of damage caused by flooding is directly related to the warning-time given before a flood occurs. Therefore, improving the coverage, accuracy and reliability of flood pre...