160 search results - page 32 / 32 » On Planar Supports for Hypergraphs |
WADS
1993
Springer
13 years 9 months ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
SC
1995
ACM
13 years 9 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
DCG
2008
13 years 5 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
DAM
2007
13 years 5 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...