52 search results - page 7 / 11 » Crossing minimization in extended level drawings of graphs |
CLA
2007
13 years 10 months ago
2007
In this work we want to discuss an algorithm for drawing line diagrams of lattices based on force directed placement (FDP). This widely used technique in graph drawing introduces f...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
GD
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
INFORMS
2010
13 years 5 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
ASYNC
2001
IEEE
14 years 2 days ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...