2612 search results - page 211 / 523 » Switching Graphs and Their Complexity |
157
click to vote
LCPC
2009
Springer
15 years 9 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
145
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
128
click to vote
IWANN
2009
Springer
15 years 11 months ago
2009
Springer
The examination of straightforwardly definable discrete structures in nucleic acids and proteins turned out to be perhaps the most important development in our present knowledge a...
141
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
131
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...