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 条
  • [1] Finding Hamiltonian cycles
    Altschuler, EL
    Lades, M
    Stong, R
    SCIENCE, 1996, 273 (5274) : 413 - 414
  • [2] FINDING HIDDEN HAMILTONIAN CYCLES
    BRODER, AZ
    FRIEZE, AM
    SHAMIR, E
    RANDOM STRUCTURES & ALGORITHMS, 1994, 5 (03) : 395 - 410
  • [3] Finding large cycles in Hamiltonian graphs
    Feder, Tomas
    Motwani, Rajeev
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (08) : 882 - 893
  • [4] Finding Large Cycles in Hamiltonian Graphs
    Feder, Tomas
    Motwani, Rajeev
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 166 - 175
  • [5] On Finding Hamiltonian Cycles in Barnette Graphs
    Bagheri, Behrooz Gh
    Fleischner, Herbert
    Feder, Tomas
    Subi, Carlos
    FUNDAMENTA INFORMATICAE, 2022, 188 (01) : 1 - 14
  • [6] FINDING HAMILTONIAN CYCLES IN CERTAIN PLANAR GRAPHS
    CIMIKOWSKI, RJ
    INFORMATION PROCESSING LETTERS, 1990, 35 (05) : 249 - 254
  • [7] An algorithm for finding a similar subgraph of all Hamiltonian cycles
    Wafdan, R.
    Ihsan, M.
    Suhaimi, D.
    1ST INTERNATIONAL CONFERENCE OF EDUCATION ON SCIENCES, TECHNOLOGY, ENGINEERING, AND MATHEMATICS (ICE-STEM), 2018, 948
  • [8] Finding Hamiltonian cycles on incrementally extensible hypercube graphs
    Keh, HC
    Chou, PY
    Lin, JC
    HIGH PERFORMANCE COMPUTING ON THE INFORMATION SUPERHIGHWAY - HPC ASIA '97, PROCEEDINGS, 1997, : 361 - 366
  • [9] Finding Hamiltonian Cycles in Circular Intuitionistic Fuzzy Graphs
    Traneva, Velichka
    Tranev, Stoyan
    Todorov, Venelin
    INTELLIGENT AND FUZZY SYSTEMS, INFUS 2024 CONFERENCE, VOL 1, 2024, 1088 : 503 - 512
  • [10] FAST PARALLEL ALGORITHMS FOR FINDING HAMILTONIAN PATHS AND CYCLES IN A TOURNAMENT
    SOROKER, D
    JOURNAL OF ALGORITHMS, 1988, 9 (02) : 276 - 286
12345