814 search results - page 91 / 163 » Optimal pairings |
121
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
140
click to vote
CCCG
2010
15 years 4 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
103
click to vote
CSC
2006
15 years 4 months ago
2006
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
128
click to vote
SIROCCO
2001
15 years 4 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
124
click to vote
WSCG
2004
15 years 4 months ago
2004
This paper presents a stochastic iteration algorithm solving the global illumination problem, where the random sampling is governed by classical importance sampling and also by th...