686 search results - page 102 / 138 » Packing Cycles in Graphs |
114
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
94
Voted
ICPPW
2006
IEEE
15 years 6 months ago
2006
IEEE
In retargeting loop-based code for multimedia instruction set extensions, a critical issue is that vector data types of mixed precision within a loop body complicate the paralleli...
112
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
103
Voted
CIBCB
2007
IEEE
15 years 7 months ago
2007
IEEE
The susceptible, infected, removed model for epidemics assumes that the population in which the epidemic takes place is well mixed. This strong assumption can be relaxed by permit...
94
Voted
VRML
1995
ACM
15 years 4 months ago
1995
ACM
We visualize the structure of sections of the World Wide Web by constructing graphical representations in 3D hyperbolic space. The felicitous property that hyperbolic space has ...