CONCERNING CONTINUA IRREDUCIBLE ABOUT N-POINTS

被引：4
作者：
SORGENFREY, RH
机构：
来源：
AMERICAN JOURNAL OF MATHEMATICS | 1946年 / 68卷 / 04期
关键词：
D O I：
10.2307/2371790
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：667 / 671
页数：5
相关论文
共 50 条
  • [31] A distance between populations for n-points crossover in genetic algorithms
    Castelli, Mauro
    Cattaneo, Gianpiero
    Manzoni, Luca
    Vanneschi, Leonardo
    SWARM AND EVOLUTIONARY COMPUTATION, 2019, 44 : 636 - 645
  • [32] Robust surface registration using N-points approximate congruent sets
    Yao, Jian
    Ruggeri, Mauro R.
    Taddei, Pierluigi
    Sequeira, Vitor
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2011,
  • [33] AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANE
    CHANG, RC
    LEE, RCT
    BIT, 1986, 26 (01): : 7 - 16
  • [34] MONOTONE DECOMPOSITIONS INTO TREES OF HAUSDORFF CONTINUA IRREDUCIBLE ABOUT A FINITE SUBSET
    VOUGHT, EJ
    PACIFIC JOURNAL OF MATHEMATICS, 1974, 54 (02) : 253 - 261
  • [35] CONCERNING 3 QUESTIONS OF BURGESS ABOUT HOMOGENEOUS CONTINUA
    COOK, H
    COLLOQUIUM MATHEMATICUM, 1968, 19 (02) : 241 - &
  • [36] CONCERNING EXACTLY (N,1) IMAGES OF CONTINUA
    NADLER, SB
    WARD, LE
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1983, 87 (02) : 351 - 354
  • [37] MONOTONE DECOMPOSITIONS INTO TREES OF HAUSDORFF CONTINUA IRREDUCIBLE ABOUT A FINITE SUBSET
    VOUGHT, EJ
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (03): : A412 - A413
  • [38] DYNAMIQUE RELATIVISTE DES N-POINTS ET STATIQUE CLASSIQUE DES N-FILS
    DEBEAUREGARD, OC
    COMPTES RENDUS HEBDOMADAIRES DES SEANCES DE L ACADEMIE DES SCIENCES, 1953, 237 (22): : 1395 - 1397
  • [39] Robust surface registration using N-points approximate congruent sets
    Jian Yao
    Mauro R Ruggeri
    Pierluigi Taddei
    Vítor Sequeira
    EURASIP Journal on Advances in Signal Processing, 2011
  • [40] DELAUNAY TRIANGULATION AND THE CONVEX-HULL OF N-POINTS IN EXPECTED LINEAR TIME
    MAUS, A
    BIT NUMERICAL MATHEMATICS, 1984, 24 (02) : 151 - 163
12345