26 citations · 60 across the 7 of their papers we have counts for
Showing 2000Show all
2 papers · 1 filter
cs.DM2000★ 26 cited
Toward the Rectilinear Crossing Number of : New Drawings, Upper Bounds, and Asymptotics
Alex Brodsky, Stephane Durocher, Ellen Gethner
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A re…
cs.DM2000★ 1 cited
The Rectilinear Crossing Number of K_10 is 62
Alex Brodsky, Stephane Durocher, Ellen Gethner
A drawing of a graph G in the plane is said to be a rectilinear drawing of G if the edges are required to be line segments (as opposed to Jordan curves). We assume no three vertice…