Sciweavers

218 search results - page 14 / 44
» Local Properties of Triangular Graphs
Sort
View
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 10 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
CVPR
2007
IEEE
14 years 10 months ago
Delaunay Deformable Models: Topology-Adaptive Meshes Based on the Restricted Delaunay Triangulation
In this paper, we propose a robust and efficient Lagrangian approach, which we call Delaunay Deformable Models, for modeling moving surfaces undergoing large deformations and topo...
Jean-Philippe Pons, Jean-Daniel Boissonnat
IMR
2004
Springer
14 years 2 months ago
Identification and Preservation of Surface Features
A surface is often approximated by a network of triangular facets. In the absence of a precise mathematical description of the underlying surface all information about surface pro...
Timothy J. Baker
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
14 years 5 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
LATA
2009
Springer
14 years 3 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle