In this paper, we introduce the following new concept in graph drawing. Our task is to find a small collection of drawings such that they all together satisfy some property that is useful for graph visualization. We propose investigating a property where each edge is not crossed in at least one drawing in the collection. We call such collection uncrossed. Such property is motivated by a quintessential problem of the crossing number, where one asks for a plane drawing where the number of edge crossings is minimum. Indeed, if we are allowed to visualize only one drawing, then the one which minimizes the number of crossings is probably the neatest for the first orientation. However, a collection of drawings where each highlights a different as...
International audienceAn effective way to reduce clutter in a graph drawing that has (many) crossing...
Edge crossings in a graph drawing are an important factor in the drawing’s quality. However, it is n...
Edge crossings in a graph drawing are an important factor in the drawing’s quality. However, it is n...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a l...
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges th...
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number p...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = ...
International audienceAn effective way to reduce clutter in a graph drawing that has (many) crossing...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
International audienceAn effective way to reduce clutter in a graph drawing that has (many) crossing...
Edge crossings in a graph drawing are an important factor in the drawing’s quality. However, it is n...
Edge crossings in a graph drawing are an important factor in the drawing’s quality. However, it is n...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a l...
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges th...
We define the concept of crossing numbers for simultaneous graphs by extending the crossing number p...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph...
The crossing number of a graph is the minimum number of edge crossings in any drawing of the graph i...
In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = ...
International audienceAn effective way to reduce clutter in a graph drawing that has (many) crossing...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of t...
AbstractIn drawings (two edges have at most one point in common, either a node or a crossing) of the...
International audienceAn effective way to reduce clutter in a graph drawing that has (many) crossing...
Edge crossings in a graph drawing are an important factor in the drawing’s quality. However, it is n...
Edge crossings in a graph drawing are an important factor in the drawing’s quality. However, it is n...