Spanning trees with low crossing number
Jiří Matoušek (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jiří Matoušek (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
F. Jones (1970)
Fundamenta Mathematicae
Similarity:
M. Talamo, G. Gambosi (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
V. B. Balayogan, C. Pandu Rangan (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
R. Moore (1922)
Fundamenta Mathematicae
Similarity:
Sierpinski has shown (Wacław Sierpiński Sur une condition pour qu'un continu soit une courbe jordanienne, Fundamenta Mathematicae I (1920), pp. 44-60) that in order that a closed and connected set of points M should be a continuous curve it is necessary and sufficient that, for every positive number ϵ, the connected point-set M should be the sum of a finite number of closed and connected point-sets each of diameter less than ϵ. It follows that, as applied to point-sets which are closed,...
Hans-Peter Lenhof, Michiel Smid (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Francis Avnaim, Jean-Daniel Boissonnat (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Dugošija, Đorđe (2001)
Matematichki Vesnik
Similarity: