Sciweavers

396 search results - page 7 / 80
» Crossing Numbers
Sort
View
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 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
DCG
2006
96views more  DCG 2006»
13 years 7 months ago
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
ENDM
2008
118views more  ENDM 2008»
13 years 7 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
ICEIS
2006
IEEE
14 years 1 months ago
Fuzzy Interval Number (FIN) Techniques for Cross Language Information Retrieval
Catherine Marinagi, Theodoros Alevizos, Vassilis G...
COMPGEOM
2006
ACM
14 years 1 months ago
Degenerate crossing numbers
János Pach, Géza Tóth