942 search results - page 121 / 189 » Constraints in Graph Drawing Algorithms |
LPAR
2005
Springer
14 years 3 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
SGP
2007
14 years 12 days ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
STOC
1995
ACM
14 years 1 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
VISSYM
2003
13 years 11 months ago
2003
A high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curehavior and construct an abstract representation given by a (topolog...
SIROCCO
1997
13 years 11 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...