Counting difficult tree pairs with respect to the rotation distance problem

被引：0
|
作者：
机构：
[1] Cleary, Sean
[2] Maio, Roland
来源：
| 1600年 / Charles Babbage Research Centre卷 / 115期
关键词：
Rotation;
D O I：
暂无
中图分类号：
O3 [力学];
学科分类号：
08 ; 0801 ;
摘要：
引用
收藏
相关论文
共 49 条
  • [21] Modeling and solving the rooted distance-constrained minimum spanning tree problem
    Gouveia, Luis
    Paias, Ana
    Sharma, Dushyant
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (02) : 600 - 613
  • [22] Tree-approximations for the weighted Cost-Distance problem (extended abstract)
    Schindelhauer, C
    Weber, B
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 185 - 195
  • [23] A Distance-based Information Preservation Tree Crossover for the Maximum Parsimony problem
    Goeffon, Adrien
    Richer, Jean-Michel
    Hao, Jin-Kao
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN IX, PROCEEDINGS, 2006, 4193 : 761 - 770
  • [24] INVERSE SINGLE FACILITY LOCATION PROBLEM ON A TREE WITH BALANCING ON THE DISTANCE OF SERVER TO CLIENTS
    Omidi, Shahede
    Fathali, Jafar
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2022, 18 (02) : 1247 - 1259
  • [25] Investigation of a fixed point problem for Pata-type contractions with respect to w-distance
    Roy, Subhadip
    Chakraborty, Priyam
    Ghosh, Sumon
    Saha, Parbati
    Choudhury, Binayak S. S.
    JOURNAL OF ANALYSIS, 2024, 32 (01): : 125 - 136
  • [26] Partial Tree-Edit Distance: A Solution to the Default Class Problem in Pattern-Based Tree Classification
    Piernik, Maciej
    Morzy, Tadeusz
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2017, PT II, 2017, 10235 : 208 - 219
  • [27] Investigation of a fixed point problem for Pata-type contractions with respect to w-distance
    Subhadip Roy
    Priyam Chakraborty
    Sumon Ghosh
    Parbati Saha
    Binayak S. Choudhury
    The Journal of Analysis, 2024, 32 : 125 - 136
  • [28] Connecting the Houses at FttH with Respect for Social Costs: Solving a Streiner Tree Problem with Timing Benefits
    Phillipson, Frank
    2014 IEEE 21ST SYMPOSIUM ON COMMUNICATIONS AND VEHICULAR TECHNOLOGY IN THE BENELUX (SCVT), 2014, : 18 - 23
  • [29] DUALITY AND DISTANCE CONSTRAINTS FOR THE NON-LINEAR P-CENTER PROBLEM AND COVERING PROBLEM ON A TREE NETWORK
    TANSEL, BC
    FRANCIS, RL
    LOWE, TJ
    CHEN, ML
    OPERATIONS RESEARCH, 1982, 30 (04) : 725 - 744
  • [30] A Parallel Extension Rule-Based Algorithm for #SAT Problem using Model-counting tree
    Tian, Naiyu
    Ouyang, Dantong
    Jia, Fengyu
    Liu, Meng
    Zhang, Liming
    IEEE ACCESS, 2018, 6 : 41042 - 41049
12345