396 search results - page 38 / 80 » Odd Crossing Number Is Not Crossing Number |
JGAA
2002
14 years 9 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
110
click to vote
ICIP
1994
IEEE
15 years 11 months ago
1994
IEEE
The development of a system able to detect and track moving people is described. Given a sequence of timevarying images, the goal is to count the number of people crossing a count...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
GD
2005
Springer
15 years 3 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
IV
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper introduces a number of refinements to the Parallel Coordinates visualisation metaphor for multidimensional data. Firstly, the traditional set of poly-lines are replaced...