A DATA STRUCTURE USEFUL FOR FINDING HAMILTONIAN CYCLES

作     者：CHROBAK, M SZYMACHA, T KRAWCZYK, A 

作者机构：UNIV WARSAWINST MATHPKIN IX PPL-00901 WARSAWPOLAND 

出 版 物：《THEORETICAL COMPUTER SCIENCE》 (理论计算机科学)

年 卷 期：1990年第71卷第3期

页      面：419-424页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Data Processing 

摘      要：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.