449 search results - page 15 / 90 » Degenerate crossing numbers |
APPROX
2004
Springer
14 years 24 days ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
CGF
2006
13 years 7 months ago
2006
Linear interpolation is the standard image blending method used in image compositing. By averaging in the dynamic range, it reduces contrast and visibly degrades the quality of co...
HICSS
2009
IEEE
14 years 2 months ago
2009
IEEE
Digital cross-organizational and cross-border collaboration are emerging research issues. Significant drivers of this development are collaboration-related information systems. A ...
JCT
2007
13 years 7 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
JCT
2007
13 years 7 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...