16 search results - page 1 / 4» Crossing Minimization in Weighted Bipartite Graphs |

WEA

2007

Springer

13 years 10 months ago
2007

Springer

Given a bipartite graph G = (L0, L1, E) and a ﬁxed ordering of the nodes in L0, the problem of ﬁnding an ordering of the nodes in L1 that minimizes the number of crossings has ...

CATS

2008

13 years 5 months ago
2008

Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...

WEA

2010

Springer

13 years 11 months ago
2010

Springer

A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...

IPL

2002

13 years 3 months ago
2002

The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...

COCOA

2007

Springer

13 years 10 months ago
2007

Springer

The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...