Sciweavers

1633 search results - page 199 / 327
» Planar Map Graphs
Sort
View
WADS
1993
Springer
110views Algorithms» more  WADS 1993»
14 years 2 months ago
A Dynamic Separator Algorithm
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 ...
Deganit Armon, John H. Reif
SODA
2007
ACM
123views Algorithms» more  SODA 2007»
14 years 1 days ago
Region-fault tolerant geometric spanners
We introduce the concept of region-fault tolerant spanners for planar point sets, and prove the existence of region-fault tolerant spanners of small size. For a geometric graph G ...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 13 hour ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 9 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
TVCG
2008
174views more  TVCG 2008»
13 years 10 months ago
Data-Driven Visualization and Group Analysis of Multichannel EEG Coherence with Functional Units
Abstract-- A typical data-driven visualization of electroencephalography (EEG) coherence is a graph layout, with vertices representing electrodes and edges representing significant...
Michael ten Caat, Natasha M. Maurits, Jos B. T. M....