942 search results - page 31 / 189 » Constraints in Graph Drawing Algorithms |
138
Voted
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. This paper proposes to use local search inside filtering algorithms of combinatorial structures for which achieving a desired level of consistency is too computationally ...
108
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
In this paper, we study the problem of how to generate synthetic graphs matching various properties of a real social network with two applications, privacy preserving social netwo...
128
Voted
AI
2003
Springer
15 years 7 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
140
Voted
GD
1995
Springer
15 years 6 months ago
1995
Springer
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
99
Voted
GD
1999
Springer
15 years 6 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...