205 search results - page 6 / 41 » Engineering Planar Separator Algorithms |
RT
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Wavelet radiosity is, by its nature, restricted to parallelograms or triangles. This paper presents an innovative technique enabling wavelet radiosity computations on pla...
INFOCOM
2007
IEEE
15 years 3 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
WADS
2001
Springer
15 years 1 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...