829 search results - page 124 / 166 » Distance domination-critical graphs |
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2 . These codes can be represented as weighted graphs, and orbits of graphs under the genera...
ERSA
2006
2006
GifT: A Gravity-Directed and Life-Time Based Algorithm for Temporal Partitioning of Data Flow Graphs
15 years 1 months ago
In reconfigurable systems, reconfiguration latency has a significant impact on the system performance. In this work, a temporal partitioning algorithm is presented to partition da...
104
click to vote
SIROCCO
2001
15 years 1 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
GD
2008
Springer
15 years 27 days ago
2008
Springer
Abstract. As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the...
DM
2006
14 years 12 months ago
2006
A reflexive graph is a simple undirected graph where a loop has been added at each vertex. If G and H are reflexive graphs and U V (H), then a vertex map f : U V (G) is called n...