AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a limited group of specialists, emerges as a significant graph parameter. This paper has dual purposes: first, it reviews foundational, historical, and philosophical issues of crossing numbers, second, it shows a new lower bound for crossing numbers. This new lower bound may be helpful in estimating crossing numbers
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
The planarization method is the strongest known method to heuristi-cally find good solutions to the ...
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a l...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
We give a survey of recent techniques for deriving lower bounds and algorithms for constructing uppe...
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a g...
Inspired by the increasingly popular research on extending partial graph drawings, we propose a new ...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem o...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number of a graph is the least number of crossings over all possible drawings of . We ...
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs whic...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline ...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
The planarization method is the strongest known method to heuristi-cally find good solutions to the ...
AbstractThis paper surveys how the concept of crossing number, which used to be familiar only to a l...
In this paper we present a branch-and-bound algorithm for finding the minimum crossing number of a g...
We give a survey of recent techniques for deriving lower bounds and algorithms for constructing uppe...
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a g...
Inspired by the increasingly popular research on extending partial graph drawings, we propose a new ...
The crossing number, cr(G), of a graph G is the least number of cross-ing points in any drawing of G...
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem o...
The crossing number of a graph G=(V,E), denoted by cr(G), is the smallest number of edge crossings i...
The crossing number of a graph is the least number of crossings over all possible drawings of . We ...
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs whic...
AbstractA drawing of a graph G is a mapping which assigns to each vertex a point of the plane and to...
A drawing of a graph is pseudolinear if there is a pseudoline arrangement such that each pseudoline ...
AbstractIn this paper we obtain a combinatorial lower bound δg(G) for the crossing number crg(G) of ...
AbstractAn algebraic structure, related to the crossing number, is constructed from a given graph
The planarization method is the strongest known method to heuristi-cally find good solutions to the ...