28 search results - page 1 / 6 » Counting Plane Graphs: Flippability and its Applications |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edge...
PARA
2004
Springer
13 years 10 months ago
2004
Springer
This paper gives a numerical algorithm able to compute the number of path-connected components of a set S defined by nonlinear inequalities. This algorithm uses interval analysis ...
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
CPC
2010
13 years 2 months ago
2010
A string graph is the intersection graph of a collection of continuous arcs in the plane. It is shown that any string graph with m edges can be separated into two parts of roughly...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...