328 search results - page 47 / 66 » Algorithms for the edge-width of an embedded graph |
74
Voted
DAC
2009
ACM
15 years 4 months ago
2009
ACM
For a computing system to be trusted, it is equally important to verify that the system performs no more and no less functionalities than desired. Traditional testing and verifica...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
60
Voted
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
With the term flexibility, we introduce a new design dimension of an embedded system that quantitatively characterizes its feasibility in implementing not only one, but possibly ...
ISPAN
1997
IEEE
15 years 1 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
84
Voted
PG
1997
IEEE
15 years 1 months ago
1997
IEEE
Recently, animations with deforming objects are frequently used in various Computer Graphics applications. Metamorphosis (or morphing) of three dimensional objects is one of techn...