449 search results - page 13 / 90 » Degenerate crossing numbers |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
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 ...
DCG
2010
13 years 6 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 ...
VISUALIZATION
2005
IEEE
14 years 29 days ago
2005
IEEE
Analysis of degenerate tensors is a fundamental step in finding the topological structures and separatrices in tensor fields. Previous work in this area have been limited to ana...
ISCAS
2003
IEEE
14 years 20 days ago
2003
IEEE
Higher transistor transition frequencies, lower supply voltages and smaller physical dimensions are, nowadays, general trends in the semiconductor industry. Operating at lower sup...
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...