A DATA STRUCTURE USEFUL FOR FINDING HAMILTONIAN CYCLES

被引：17
|
作者：
CHROBAK, M [1 ]
SZYMACHA, T [1 ]
KRAWCZYK, A [1 ]
机构：
[1] UNIV WARSAW,INST MATH,PKIN IX P,PL-00901 WARSAW,POLAND
来源：
THEORETICAL COMPUTER SCIENCE | 1990年 / 71卷 / 03期
关键词：
D O I：
10.1016/0304-3975(90)90053-K
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We present a data structure, called the reversable AVL-trees, for maintaining a sequence of special operations called reversals. This data structure is based on balanced trees, and it yields an algorithm with complexity O(m log n), where m is the number of reversals. © 1990.
引用
收藏
页码：419 / 424
页数：6
相关论文
共 50 条
  • [41] ENUMERATION OF HAMILTONIAN CYCLES ON A THICK GRID CYLINDER - PART II: CONTRACTIBLE HAMILTONIAN CYCLES
    Bodroza-Pantic, Olga
    Kwong, Harris
    Dokic, Jelena
    Doroslovacki, Rade
    Pantic, Milan
    APPLICABLE ANALYSIS AND DISCRETE MATHEMATICS, 2022, 16 (01) : 246 - 287
  • [42] DECOMPOSITION OF THE CARTESIAN SUM OF ONE CYCLE AND THE UNION OF 2 HAMILTONIAN CYCLES INTO HAMILTONIAN CYCLES
    AUBERT, J
    SCHNEIDER, B
    DISCRETE MATHEMATICS, 1982, 38 (01) : 7 - 16
  • [43] A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
    Keshavarz-Kohjerdi, Fatemeh
    Bagheri, Alireza
    OPTIMIZATION METHODS & SOFTWARE, 2023, 38 (03): : 591 - 625
  • [44] Finding structure in signals, images, and data
    Oja, E
    8TH INTERNATIONAL CONFERENCE ON NEURAL INFORMATION PROCESSING, VOLS 1-3, PROCEEDING, 2001, : P9 - P13
  • [45] Enhanced sequitur for finding structure in data
    Earl, E
    Ladner, RE
    DCC 2003: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2003, : 425 - 425
  • [46] GENERALIZATION OF HAMILTONIAN CYCLES FOR TREES
    NEBESKY, L
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1976, 26 (04) : 596 - 603
  • [47] Removable matchings and hamiltonian cycles
    Hu, Zhiquan
    Li, Hao
    DISCRETE MATHEMATICS, 2009, 309 (05) : 1020 - 1024
  • [48] Hamiltonian Cycles in the Square of a Graph
    Ekstein, Jan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [49] A note on equitable Hamiltonian cycles
    Ophelders, Tim
    Lambers, Roel
    Spieksma, Frits C. R.
    Vredeveld, Tjark
    DISCRETE APPLIED MATHEMATICS, 2021, 303 : 127 - 136
  • [50] EXTENDING PAIRINGS TO HAMILTONIAN CYCLES
    Fon-Der-Flaass, D. G.
    SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA, 2010, 7 : 115 - 118
12345