659 search results - page 50 / 132 » Dynamic Algorithms for Graph Spanners |
SAT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Shape skeleton extraction is a fundamental preprocessing task in shape-based pattern recognition. This paper presents a new algorithm for fast and precise extraction of kinematic ...
ICDE
2008
IEEE
14 years 2 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...