942 search results - page 25 / 189 » Constraints in Graph Drawing Algorithms |
ESA
2000
Springer
14 years 7 days ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
HEURISTICS
2006
13 years 8 months ago
2006
In case a CSP is over-constrained, it is natural to allow some constraints, called soft constraints, to be violated. We propose a generic method to soften global constraints that c...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...