942 search results - page 34 / 189 » Constraints in Graph Drawing Algorithms |
FLAIRS
2003
15 years 4 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
109
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
129
Voted
GD
1997
Springer
15 years 6 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
98
Voted
APVIS
2009
15 years 3 months ago
2009
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
ISAAC
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a pr...