136 search results - page 8 / 28 » Crossing and Weighted Crossing Number of Near-Planar Graphs |
ENDM
2007
13 years 7 months ago
2007
CORR
2010
Springer
13 years 5 months ago
2010
Springer
ENDM
2008
13 years 7 months ago
2008
The nth crossing number of a graph G, denoted crn(G), is the minimum number of crossings in a drawing of G on an orientable surface of genus n. We prove that for every a > b &g...
WG
2010
Springer
13 years 6 months ago
2010
Springer
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...
APPROX
2004
Springer
14 years 1 months 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...