Sciweavers

409 search results - page 11 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
COCOA
2007
Springer
15 years 3 months ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
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...
Lanbo Zheng, Christoph Buchheim
SDM
2008
SIAM
165views Data Mining» more  SDM 2008»
14 years 11 months ago
On the Dangers of Cross-Validation. An Experimental Evaluation
Cross validation allows models to be tested using the full training set by means of repeated resampling; thus, maximizing the total number of points used for testing and potential...
R. Bharat Rao, Glenn Fung
83
Voted
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
74
Voted
WALCOM
2010
IEEE
206views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Crossings between Curves with Many Tangencies
Let A and B be two families of two-way infinite x-monotone curves, no three of which pass through the same point. Assume that every curve in A lies above every curve in B and that...
Jacob Fox, Fabrizio Frati, János Pach, Rom ...