Sciweavers

104 search results - page 10 / 21
» Witness (Delaunay) Graphs
Sort
View
OA
1989
237views Algorithms» more  OA 1989»
13 years 12 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph
BIRTHDAY
2005
Springer
14 years 1 months ago
Graph Transformation with Variables
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
Berthold Hoffmann
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 6 months ago
Applications of Geometric Algorithms to Reduce Interference in Wireless Mesh Network
In wireless mesh networks such as WLAN (IEEE 802.11s) or WMAN (IEEE 802.11), each node should help to relay packets of neighboring nodes toward gateway using multi-hop routing mec...
Hung-Chin Jang
GD
2007
Springer
13 years 11 months ago
Efficient Extraction of Multiple Kuratowski Subdivisions
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
Markus Chimani, Petra Mutzel, Jens M. Schmidt
ICCV
2003
IEEE
14 years 1 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock