396 search results - page 11 / 80 » Odd Crossing Number Is Not Crossing Number |
DCG
2010
14 years 8 months ago
2010
Given any knot diagram E, we present a sequence of knot diagrams of the same knot type, for which the minimum number of Reidemeister moves required to pass to E is quadratic with ...
ENDM
2008
14 years 9 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...
COMPGEOM
1996
ACM
15 years 1 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
The development of autonomous multi-agent systems acting upon the interests of one or more users involves the elicitation of preferences of these users. In decision theory, models...
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...