4880 search results - page 502 / 976 » Manuals as Structured Programs |
171
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
253
click to vote
OOGRAPHICS
1995
15 years 10 months ago
1995
The structure of the image synthesis process naturally leads to the use of object-oriented software design and many existing rendering systems are based on some kind of object-orie...
200
click to vote
SNPD
2003
15 years 8 months ago
2003
We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms in so-called direct mode. In a directmode BSP algorithm...
188
click to vote
DAM
2006
15 years 7 months ago
2006
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
186
click to vote
JPDC
2006
15 years 7 months ago
2006
With the increasing availability of high-performance massively parallel computer systems, the prevalence of sophisticated scientific simulation has grown rapidly. The complexity o...